./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal14.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal14.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 35e41100eac4151f900ff6bd781c82e1d1b295799564c0d21c287769e6286f74 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:34:51,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:34:51,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 05:34:51,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:34:51,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:34:51,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:34:51,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:34:51,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:34:51,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:34:51,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:34:51,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:34:51,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:34:51,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:34:51,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:34:51,106 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:34:51,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:34:51,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:34:51,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:34:51,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:34:51,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:34:51,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:34:51,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:34:51,111 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:34:51,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:34:51,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:34:51,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:34:51,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:34:51,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:34:51,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:34:51,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:34:51,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:34:51,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:34:51,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:34:51,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:34:51,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:34:51,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:34:51,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:34:51,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:34:51,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:34:51,117 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35e41100eac4151f900ff6bd781c82e1d1b295799564c0d21c287769e6286f74 [2024-10-11 05:34:51,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:34:51,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:34:51,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:34:51,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:34:51,343 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:34:51,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal14.c [2024-10-11 05:34:52,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:34:53,004 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:34:53,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal14.c [2024-10-11 05:34:53,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cbbf96bff/a3ac0c677f99490dae82d5765695c9e9/FLAG9fc3848fe [2024-10-11 05:34:53,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cbbf96bff/a3ac0c677f99490dae82d5765695c9e9 [2024-10-11 05:34:53,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:34:53,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:34:53,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:34:53,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:34:53,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:34:53,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:53,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f72090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53, skipping insertion in model container [2024-10-11 05:34:53,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:53,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:34:53,340 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal14.c[1245,1258] [2024-10-11 05:34:53,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:34:53,739 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:34:53,749 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal14.c[1245,1258] [2024-10-11 05:34:53,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:34:53,862 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:34:53,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53 WrapperNode [2024-10-11 05:34:53,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:34:53,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:34:53,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:34:53,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:34:53,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:53,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:54,376 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3608 [2024-10-11 05:34:54,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:34:54,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:34:54,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:34:54,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:34:54,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:54,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:54,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:54,568 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-11 05:34:54,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:54,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:54,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:54,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:54,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:54,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:54,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:34:54,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:34:54,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:34:54,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:34:54,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (1/1) ... [2024-10-11 05:34:54,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:34:54,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:34:54,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:34:54,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:34:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:34:54,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:34:54,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 05:34:54,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:34:54,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:34:55,209 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:34:55,211 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:34:58,872 INFO L? ?]: Removed 2024 outVars from TransFormulas that were not future-live. [2024-10-11 05:34:58,872 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:34:58,955 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:34:58,956 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:34:58,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:34:58 BoogieIcfgContainer [2024-10-11 05:34:58,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:34:58,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:34:58,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:34:58,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:34:58,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:34:53" (1/3) ... [2024-10-11 05:34:58,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f24b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:34:58, skipping insertion in model container [2024-10-11 05:34:58,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:34:53" (2/3) ... [2024-10-11 05:34:58,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f24b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:34:58, skipping insertion in model container [2024-10-11 05:34:58,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:34:58" (3/3) ... [2024-10-11 05:34:58,967 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal14.c [2024-10-11 05:34:58,980 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:34:58,981 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:34:59,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:34:59,056 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@434bd62c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:34:59,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:34:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 1074 states, 1072 states have (on average 1.501865671641791) internal successors, (1610), 1073 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:34:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-11 05:34:59,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:34:59,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:34:59,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:34:59,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:34:59,090 INFO L85 PathProgramCache]: Analyzing trace with hash 119210446, now seen corresponding path program 1 times [2024-10-11 05:34:59,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:34:59,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955024043] [2024-10-11 05:34:59,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:34:59,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:34:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:01,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:01,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955024043] [2024-10-11 05:35:01,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955024043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:01,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:01,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:35:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417288238] [2024-10-11 05:35:01,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:01,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:35:01,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:01,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:35:01,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:35:01,437 INFO L87 Difference]: Start difference. First operand has 1074 states, 1072 states have (on average 1.501865671641791) internal successors, (1610), 1073 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:01,569 INFO L93 Difference]: Finished difference Result 2120 states and 3180 transitions. [2024-10-11 05:35:01,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:35:01,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2024-10-11 05:35:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:01,599 INFO L225 Difference]: With dead ends: 2120 [2024-10-11 05:35:01,600 INFO L226 Difference]: Without dead ends: 1075 [2024-10-11 05:35:01,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:35:01,618 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 0 mSDsluCounter, 3205 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4810 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:01,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4810 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:35:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2024-10-11 05:35:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2024-10-11 05:35:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1074 states have (on average 1.499068901303538) internal successors, (1610), 1074 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1610 transitions. [2024-10-11 05:35:01,709 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1610 transitions. Word has length 340 [2024-10-11 05:35:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:01,711 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1610 transitions. [2024-10-11 05:35:01,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1610 transitions. [2024-10-11 05:35:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-10-11 05:35:01,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:01,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:01,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:35:01,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:01,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash -597746118, now seen corresponding path program 1 times [2024-10-11 05:35:01,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:01,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972049609] [2024-10-11 05:35:01,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:01,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:02,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:02,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972049609] [2024-10-11 05:35:02,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972049609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:02,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:02,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:35:02,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743024587] [2024-10-11 05:35:02,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:02,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:35:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:02,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:35:02,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:35:02,610 INFO L87 Difference]: Start difference. First operand 1075 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:02,714 INFO L93 Difference]: Finished difference Result 2123 states and 3180 transitions. [2024-10-11 05:35:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:35:02,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 341 [2024-10-11 05:35:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:02,721 INFO L225 Difference]: With dead ends: 2123 [2024-10-11 05:35:02,722 INFO L226 Difference]: Without dead ends: 1077 [2024-10-11 05:35:02,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:35:02,724 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 0 mSDsluCounter, 3202 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4807 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:02,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4807 Invalid, 16 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:35:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-10-11 05:35:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1077. [2024-10-11 05:35:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.4981412639405205) internal successors, (1612), 1076 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1612 transitions. [2024-10-11 05:35:02,762 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1612 transitions. Word has length 341 [2024-10-11 05:35:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:02,763 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1612 transitions. [2024-10-11 05:35:02,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1612 transitions. [2024-10-11 05:35:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-11 05:35:02,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:02,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:02,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:35:02,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:02,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:02,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1846743079, now seen corresponding path program 1 times [2024-10-11 05:35:02,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:02,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748353907] [2024-10-11 05:35:02,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:02,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:06,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:06,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748353907] [2024-10-11 05:35:06,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748353907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:06,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:06,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:35:06,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190668692] [2024-10-11 05:35:06,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:06,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:35:06,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:06,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:35:06,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:35:06,391 INFO L87 Difference]: Start difference. First operand 1077 states and 1612 transitions. Second operand has 8 states, 8 states have (on average 42.75) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:06,909 INFO L93 Difference]: Finished difference Result 4023 states and 6029 transitions. [2024-10-11 05:35:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:35:06,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.75) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 342 [2024-10-11 05:35:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:06,914 INFO L225 Difference]: With dead ends: 4023 [2024-10-11 05:35:06,914 INFO L226 Difference]: Without dead ends: 1549 [2024-10-11 05:35:06,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:35:06,917 INFO L432 NwaCegarLoop]: 2194 mSDtfsCounter, 5447 mSDsluCounter, 10224 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5447 SdHoareTripleChecker+Valid, 12418 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:06,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5447 Valid, 12418 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:35:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2024-10-11 05:35:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1522. [2024-10-11 05:35:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.4990138067061145) internal successors, (2280), 1521 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2280 transitions. [2024-10-11 05:35:06,939 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2280 transitions. Word has length 342 [2024-10-11 05:35:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:06,940 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 2280 transitions. [2024-10-11 05:35:06,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.75) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2280 transitions. [2024-10-11 05:35:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-10-11 05:35:06,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:06,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:06,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:35:06,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:06,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash -568743147, now seen corresponding path program 1 times [2024-10-11 05:35:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:06,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778985971] [2024-10-11 05:35:06,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:06,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:09,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778985971] [2024-10-11 05:35:09,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778985971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:09,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:09,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:35:09,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231201474] [2024-10-11 05:35:09,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:09,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:35:09,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:09,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:35:09,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:35:09,574 INFO L87 Difference]: Start difference. First operand 1522 states and 2280 transitions. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:09,659 INFO L93 Difference]: Finished difference Result 3015 states and 4517 transitions. [2024-10-11 05:35:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:35:09,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2024-10-11 05:35:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:09,666 INFO L225 Difference]: With dead ends: 3015 [2024-10-11 05:35:09,667 INFO L226 Difference]: Without dead ends: 1522 [2024-10-11 05:35:09,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:35:09,670 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 896 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:09,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 3658 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:35:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2024-10-11 05:35:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1522. [2024-10-11 05:35:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.4983563445101906) internal successors, (2279), 1521 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2279 transitions. [2024-10-11 05:35:09,696 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2279 transitions. Word has length 343 [2024-10-11 05:35:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:09,697 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 2279 transitions. [2024-10-11 05:35:09,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2279 transitions. [2024-10-11 05:35:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-11 05:35:09,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:09,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:09,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:35:09,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:09,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:09,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1397805574, now seen corresponding path program 1 times [2024-10-11 05:35:09,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:09,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669098483] [2024-10-11 05:35:09,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:09,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:12,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:12,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669098483] [2024-10-11 05:35:12,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669098483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:12,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:12,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:35:12,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781169977] [2024-10-11 05:35:12,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:12,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:35:12,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:12,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:35:12,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:35:12,550 INFO L87 Difference]: Start difference. First operand 1522 states and 2279 transitions. Second operand has 7 states, 7 states have (on average 49.142857142857146) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:13,374 INFO L93 Difference]: Finished difference Result 3019 states and 4521 transitions. [2024-10-11 05:35:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:35:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.142857142857146) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2024-10-11 05:35:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:13,379 INFO L225 Difference]: With dead ends: 3019 [2024-10-11 05:35:13,379 INFO L226 Difference]: Without dead ends: 1526 [2024-10-11 05:35:13,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:35:13,382 INFO L432 NwaCegarLoop]: 1295 mSDtfsCounter, 2218 mSDsluCounter, 4243 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2218 SdHoareTripleChecker+Valid, 5538 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:13,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2218 Valid, 5538 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:35:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2024-10-11 05:35:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1525. [2024-10-11 05:35:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.4973753280839894) internal successors, (2282), 1524 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2282 transitions. [2024-10-11 05:35:13,405 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2282 transitions. Word has length 344 [2024-10-11 05:35:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:13,405 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2282 transitions. [2024-10-11 05:35:13,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.142857142857146) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2282 transitions. [2024-10-11 05:35:13,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-10-11 05:35:13,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:13,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:13,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:35:13,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:13,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 243816530, now seen corresponding path program 1 times [2024-10-11 05:35:13,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:13,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630023534] [2024-10-11 05:35:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:13,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:14,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:14,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630023534] [2024-10-11 05:35:14,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630023534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:14,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:14,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 05:35:14,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221096524] [2024-10-11 05:35:14,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:14,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:35:14,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:14,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:35:14,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 05:35:14,662 INFO L87 Difference]: Start difference. First operand 1525 states and 2282 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:14,689 INFO L93 Difference]: Finished difference Result 3021 states and 4521 transitions. [2024-10-11 05:35:14,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:35:14,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345 [2024-10-11 05:35:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:14,694 INFO L225 Difference]: With dead ends: 3021 [2024-10-11 05:35:14,694 INFO L226 Difference]: Without dead ends: 1525 [2024-10-11 05:35:14,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 05:35:14,696 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 2 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:14,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3201 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:35:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2024-10-11 05:35:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1525. [2024-10-11 05:35:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.496719160104987) internal successors, (2281), 1524 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2281 transitions. [2024-10-11 05:35:14,714 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2281 transitions. Word has length 345 [2024-10-11 05:35:14,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:14,715 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2281 transitions. [2024-10-11 05:35:14,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2281 transitions. [2024-10-11 05:35:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-10-11 05:35:14,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:14,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:14,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:35:14,719 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:14,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash 213474809, now seen corresponding path program 1 times [2024-10-11 05:35:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:14,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572087641] [2024-10-11 05:35:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:14,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:17,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572087641] [2024-10-11 05:35:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572087641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:17,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:17,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:35:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34102224] [2024-10-11 05:35:17,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:17,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:35:17,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:17,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:35:17,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:35:17,326 INFO L87 Difference]: Start difference. First operand 1525 states and 2281 transitions. Second operand has 6 states, 6 states have (on average 57.666666666666664) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:17,959 INFO L93 Difference]: Finished difference Result 3025 states and 4525 transitions. [2024-10-11 05:35:17,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:35:17,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.666666666666664) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2024-10-11 05:35:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:17,964 INFO L225 Difference]: With dead ends: 3025 [2024-10-11 05:35:17,964 INFO L226 Difference]: Without dead ends: 1529 [2024-10-11 05:35:17,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:35:17,966 INFO L432 NwaCegarLoop]: 1300 mSDtfsCounter, 1283 mSDsluCounter, 3896 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 5196 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:17,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 5196 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:35:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2024-10-11 05:35:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1528. [2024-10-11 05:35:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 1.495743287491814) internal successors, (2284), 1527 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2284 transitions. [2024-10-11 05:35:17,983 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2284 transitions. Word has length 346 [2024-10-11 05:35:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:17,984 INFO L471 AbstractCegarLoop]: Abstraction has 1528 states and 2284 transitions. [2024-10-11 05:35:17,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.666666666666664) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2284 transitions. [2024-10-11 05:35:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-11 05:35:17,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:17,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:17,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:35:17,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:17,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1953591217, now seen corresponding path program 1 times [2024-10-11 05:35:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:17,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88296125] [2024-10-11 05:35:17,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:17,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88296125] [2024-10-11 05:35:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88296125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:19,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:19,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:35:19,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508580388] [2024-10-11 05:35:19,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:19,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:35:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:35:19,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:35:19,842 INFO L87 Difference]: Start difference. First operand 1528 states and 2284 transitions. Second operand has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:19,970 INFO L93 Difference]: Finished difference Result 4346 states and 6496 transitions. [2024-10-11 05:35:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:35:19,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2024-10-11 05:35:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:19,978 INFO L225 Difference]: With dead ends: 4346 [2024-10-11 05:35:19,978 INFO L226 Difference]: Without dead ends: 2847 [2024-10-11 05:35:19,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:35:19,981 INFO L432 NwaCegarLoop]: 1595 mSDtfsCounter, 3791 mSDsluCounter, 6369 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3791 SdHoareTripleChecker+Valid, 7964 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:19,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3791 Valid, 7964 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:35:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2024-10-11 05:35:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2495. [2024-10-11 05:35:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2494 states have (on average 1.4975942261427426) internal successors, (3735), 2494 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3735 transitions. [2024-10-11 05:35:20,028 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3735 transitions. Word has length 347 [2024-10-11 05:35:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:20,029 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 3735 transitions. [2024-10-11 05:35:20,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3735 transitions. [2024-10-11 05:35:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-11 05:35:20,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:20,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:20,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:35:20,035 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:20,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:20,035 INFO L85 PathProgramCache]: Analyzing trace with hash -714643168, now seen corresponding path program 1 times [2024-10-11 05:35:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:20,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884044572] [2024-10-11 05:35:20,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:20,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:22,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:22,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884044572] [2024-10-11 05:35:22,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884044572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:22,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:22,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:35:22,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131094345] [2024-10-11 05:35:22,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:22,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:35:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:22,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:35:22,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:35:22,371 INFO L87 Difference]: Start difference. First operand 2495 states and 3735 transitions. Second operand has 6 states, 6 states have (on average 58.0) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:22,430 INFO L93 Difference]: Finished difference Result 4980 states and 7453 transitions. [2024-10-11 05:35:22,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:35:22,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.0) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2024-10-11 05:35:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:22,438 INFO L225 Difference]: With dead ends: 4980 [2024-10-11 05:35:22,438 INFO L226 Difference]: Without dead ends: 2514 [2024-10-11 05:35:22,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:35:22,443 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 1314 mSDsluCounter, 4794 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 6394 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:22,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 6394 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:35:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2024-10-11 05:35:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2512. [2024-10-11 05:35:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2512 states, 2511 states have (on average 1.4962166467542812) internal successors, (3757), 2511 states have internal predecessors, (3757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 3757 transitions. [2024-10-11 05:35:22,480 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 3757 transitions. Word has length 348 [2024-10-11 05:35:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:22,481 INFO L471 AbstractCegarLoop]: Abstraction has 2512 states and 3757 transitions. [2024-10-11 05:35:22,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.0) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 3757 transitions. [2024-10-11 05:35:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-11 05:35:22,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:22,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:22,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:35:22,486 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:22,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1850479018, now seen corresponding path program 1 times [2024-10-11 05:35:22,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:22,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083851448] [2024-10-11 05:35:22,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:24,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:24,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083851448] [2024-10-11 05:35:24,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083851448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:24,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:24,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:35:24,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657385842] [2024-10-11 05:35:24,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:24,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:35:24,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:24,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:35:24,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:35:24,355 INFO L87 Difference]: Start difference. First operand 2512 states and 3757 transitions. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:24,405 INFO L93 Difference]: Finished difference Result 4991 states and 7465 transitions. [2024-10-11 05:35:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:35:24,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2024-10-11 05:35:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:24,412 INFO L225 Difference]: With dead ends: 4991 [2024-10-11 05:35:24,412 INFO L226 Difference]: Without dead ends: 2508 [2024-10-11 05:35:24,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:35:24,415 INFO L432 NwaCegarLoop]: 1601 mSDtfsCounter, 1284 mSDsluCounter, 3196 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 4797 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:24,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 4797 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:35:24,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2024-10-11 05:35:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2508. [2024-10-11 05:35:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2508 states, 2507 states have (on average 1.495811727163941) internal successors, (3750), 2507 states have internal predecessors, (3750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 3750 transitions. [2024-10-11 05:35:24,452 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 3750 transitions. Word has length 349 [2024-10-11 05:35:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:24,453 INFO L471 AbstractCegarLoop]: Abstraction has 2508 states and 3750 transitions. [2024-10-11 05:35:24,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3750 transitions. [2024-10-11 05:35:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-11 05:35:24,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:24,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:24,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:35:24,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:24,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1147456052, now seen corresponding path program 1 times [2024-10-11 05:35:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447018001] [2024-10-11 05:35:24,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:24,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:26,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:26,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447018001] [2024-10-11 05:35:26,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447018001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:26,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:26,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:35:26,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78090171] [2024-10-11 05:35:26,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:26,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:35:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:26,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:35:26,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:35:26,640 INFO L87 Difference]: Start difference. First operand 2508 states and 3750 transitions. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:26,742 INFO L93 Difference]: Finished difference Result 4990 states and 7461 transitions. [2024-10-11 05:35:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:35:26,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2024-10-11 05:35:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:26,748 INFO L225 Difference]: With dead ends: 4990 [2024-10-11 05:35:26,748 INFO L226 Difference]: Without dead ends: 2511 [2024-10-11 05:35:26,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:35:26,751 INFO L432 NwaCegarLoop]: 1573 mSDtfsCounter, 1281 mSDsluCounter, 3141 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 4714 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:26,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 4714 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:35:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2024-10-11 05:35:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2511. [2024-10-11 05:35:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2510 states have (on average 1.4952191235059762) internal successors, (3753), 2510 states have internal predecessors, (3753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3753 transitions. [2024-10-11 05:35:26,786 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3753 transitions. Word has length 349 [2024-10-11 05:35:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:26,787 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3753 transitions. [2024-10-11 05:35:26,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3753 transitions. [2024-10-11 05:35:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-11 05:35:26,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:26,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:26,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:35:26,790 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:26,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash 859470897, now seen corresponding path program 1 times [2024-10-11 05:35:26,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:26,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143781344] [2024-10-11 05:35:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:28,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143781344] [2024-10-11 05:35:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143781344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:28,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:28,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:35:28,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835450662] [2024-10-11 05:35:28,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:35:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:28,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:35:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:35:28,417 INFO L87 Difference]: Start difference. First operand 2511 states and 3753 transitions. Second operand has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:29,250 INFO L93 Difference]: Finished difference Result 4997 states and 7469 transitions. [2024-10-11 05:35:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:35:29,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2024-10-11 05:35:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:29,259 INFO L225 Difference]: With dead ends: 4997 [2024-10-11 05:35:29,259 INFO L226 Difference]: Without dead ends: 2515 [2024-10-11 05:35:29,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:35:29,262 INFO L432 NwaCegarLoop]: 1298 mSDtfsCounter, 1577 mSDsluCounter, 5177 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 6475 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:29,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 6475 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:35:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2024-10-11 05:35:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2513. [2024-10-11 05:35:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2512 states have (on average 1.4948248407643312) internal successors, (3755), 2512 states have internal predecessors, (3755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3755 transitions. [2024-10-11 05:35:29,293 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3755 transitions. Word has length 350 [2024-10-11 05:35:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:29,294 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 3755 transitions. [2024-10-11 05:35:29,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3755 transitions. [2024-10-11 05:35:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-11 05:35:29,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:29,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:29,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:35:29,298 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:29,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1927853150, now seen corresponding path program 1 times [2024-10-11 05:35:29,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:29,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303917989] [2024-10-11 05:35:29,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:29,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:30,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:30,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303917989] [2024-10-11 05:35:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303917989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:35:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498563283] [2024-10-11 05:35:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:30,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:35:30,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:30,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:35:30,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:35:30,437 INFO L87 Difference]: Start difference. First operand 2513 states and 3755 transitions. Second operand has 5 states, 5 states have (on average 70.2) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:30,953 INFO L93 Difference]: Finished difference Result 5000 states and 7471 transitions. [2024-10-11 05:35:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:35:30,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351 [2024-10-11 05:35:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:30,960 INFO L225 Difference]: With dead ends: 5000 [2024-10-11 05:35:30,960 INFO L226 Difference]: Without dead ends: 2516 [2024-10-11 05:35:30,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:35:30,963 INFO L432 NwaCegarLoop]: 1303 mSDtfsCounter, 1269 mSDsluCounter, 2602 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 3905 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:30,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 3905 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:35:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2024-10-11 05:35:30,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2516. [2024-10-11 05:35:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2516 states, 2515 states have (on average 1.494234592445328) internal successors, (3758), 2515 states have internal predecessors, (3758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 3758 transitions. [2024-10-11 05:35:30,987 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 3758 transitions. Word has length 351 [2024-10-11 05:35:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:30,988 INFO L471 AbstractCegarLoop]: Abstraction has 2516 states and 3758 transitions. [2024-10-11 05:35:30,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 3758 transitions. [2024-10-11 05:35:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-11 05:35:30,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:30,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:30,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:35:30,995 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:30,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1814259134, now seen corresponding path program 1 times [2024-10-11 05:35:30,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:30,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803261836] [2024-10-11 05:35:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:30,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:33,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:33,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803261836] [2024-10-11 05:35:33,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803261836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:33,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:33,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:35:33,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599130463] [2024-10-11 05:35:33,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:33,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:35:33,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:33,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:35:33,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:35:33,057 INFO L87 Difference]: Start difference. First operand 2516 states and 3758 transitions. Second operand has 5 states, 5 states have (on average 70.2) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:33,100 INFO L93 Difference]: Finished difference Result 5008 states and 7480 transitions. [2024-10-11 05:35:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:35:33,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351 [2024-10-11 05:35:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:33,106 INFO L225 Difference]: With dead ends: 5008 [2024-10-11 05:35:33,106 INFO L226 Difference]: Without dead ends: 2521 [2024-10-11 05:35:33,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:35:33,108 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 1276 mSDsluCounter, 3194 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 4794 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:33,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 4794 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:35:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2024-10-11 05:35:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 2521. [2024-10-11 05:35:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 2520 states have (on average 1.4936507936507937) internal successors, (3764), 2520 states have internal predecessors, (3764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3764 transitions. [2024-10-11 05:35:33,135 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3764 transitions. Word has length 351 [2024-10-11 05:35:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:33,135 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 3764 transitions. [2024-10-11 05:35:33,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3764 transitions. [2024-10-11 05:35:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-11 05:35:33,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:33,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:33,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:35:33,139 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:33,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash -531413802, now seen corresponding path program 1 times [2024-10-11 05:35:33,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:33,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49742048] [2024-10-11 05:35:33,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:33,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:34,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49742048] [2024-10-11 05:35:34,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49742048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:34,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:35:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096557700] [2024-10-11 05:35:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:34,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:35:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:34,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:35:34,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:35:34,523 INFO L87 Difference]: Start difference. First operand 2521 states and 3764 transitions. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:34,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:34,554 INFO L93 Difference]: Finished difference Result 5011 states and 7483 transitions. [2024-10-11 05:35:34,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:35:34,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351 [2024-10-11 05:35:34,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:34,562 INFO L225 Difference]: With dead ends: 5011 [2024-10-11 05:35:34,566 INFO L226 Difference]: Without dead ends: 2519 [2024-10-11 05:35:34,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:35:34,571 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 10 mSDsluCounter, 3180 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4780 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:34,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4780 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:35:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2024-10-11 05:35:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2504. [2024-10-11 05:35:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2503 states have (on average 1.4954055133839392) internal successors, (3743), 2503 states have internal predecessors, (3743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3743 transitions. [2024-10-11 05:35:34,603 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3743 transitions. Word has length 351 [2024-10-11 05:35:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:34,604 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3743 transitions. [2024-10-11 05:35:34,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3743 transitions. [2024-10-11 05:35:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-11 05:35:34,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:34,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:34,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:35:34,607 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:34,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1075212782, now seen corresponding path program 1 times [2024-10-11 05:35:34,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:34,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778494703] [2024-10-11 05:35:34,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:34,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:36,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:36,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778494703] [2024-10-11 05:35:36,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778494703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:36,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:36,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:35:36,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458701988] [2024-10-11 05:35:36,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:36,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:35:36,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:36,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:35:36,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:35:36,791 INFO L87 Difference]: Start difference. First operand 2504 states and 3743 transitions. Second operand has 6 states, 6 states have (on average 58.666666666666664) internal successors, (352), 5 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:36,955 INFO L93 Difference]: Finished difference Result 7062 states and 10555 transitions. [2024-10-11 05:35:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:35:36,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.666666666666664) internal successors, (352), 5 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2024-10-11 05:35:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:36,964 INFO L225 Difference]: With dead ends: 7062 [2024-10-11 05:35:36,967 INFO L226 Difference]: Without dead ends: 4587 [2024-10-11 05:35:36,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:35:36,974 INFO L432 NwaCegarLoop]: 1582 mSDtfsCounter, 4115 mSDsluCounter, 4750 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4115 SdHoareTripleChecker+Valid, 6332 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:36,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4115 Valid, 6332 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:35:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2024-10-11 05:35:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4568. [2024-10-11 05:35:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4568 states, 4567 states have (on average 1.495511276549157) internal successors, (6830), 4567 states have internal predecessors, (6830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4568 states to 4568 states and 6830 transitions. [2024-10-11 05:35:37,075 INFO L78 Accepts]: Start accepts. Automaton has 4568 states and 6830 transitions. Word has length 352 [2024-10-11 05:35:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:37,076 INFO L471 AbstractCegarLoop]: Abstraction has 4568 states and 6830 transitions. [2024-10-11 05:35:37,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.666666666666664) internal successors, (352), 5 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4568 states and 6830 transitions. [2024-10-11 05:35:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-10-11 05:35:37,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:37,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:37,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:35:37,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:37,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash -119253126, now seen corresponding path program 1 times [2024-10-11 05:35:37,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:37,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460844394] [2024-10-11 05:35:37,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:40,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460844394] [2024-10-11 05:35:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460844394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:40,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:40,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:35:40,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412625448] [2024-10-11 05:35:40,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:40,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:35:40,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:40,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:35:40,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:35:40,173 INFO L87 Difference]: Start difference. First operand 4568 states and 6830 transitions. Second operand has 7 states, 7 states have (on average 50.42857142857143) internal successors, (353), 7 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:40,287 INFO L93 Difference]: Finished difference Result 7105 states and 10614 transitions. [2024-10-11 05:35:40,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:35:40,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.42857142857143) internal successors, (353), 7 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 353 [2024-10-11 05:35:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:40,293 INFO L225 Difference]: With dead ends: 7105 [2024-10-11 05:35:40,293 INFO L226 Difference]: Without dead ends: 4568 [2024-10-11 05:35:40,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:35:40,297 INFO L432 NwaCegarLoop]: 1585 mSDtfsCounter, 1366 mSDsluCounter, 5221 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 6806 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:40,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1366 Valid, 6806 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:35:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4568 states. [2024-10-11 05:35:40,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4568 to 4568. [2024-10-11 05:35:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4568 states, 4567 states have (on average 1.4950733523100503) internal successors, (6828), 4567 states have internal predecessors, (6828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4568 states to 4568 states and 6828 transitions. [2024-10-11 05:35:40,350 INFO L78 Accepts]: Start accepts. Automaton has 4568 states and 6828 transitions. Word has length 353 [2024-10-11 05:35:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:40,351 INFO L471 AbstractCegarLoop]: Abstraction has 4568 states and 6828 transitions. [2024-10-11 05:35:40,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.42857142857143) internal successors, (353), 7 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4568 states and 6828 transitions. [2024-10-11 05:35:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-10-11 05:35:40,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:40,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:40,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:35:40,355 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:40,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1387319299, now seen corresponding path program 1 times [2024-10-11 05:35:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:40,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467722750] [2024-10-11 05:35:40,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:40,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:42,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:42,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467722750] [2024-10-11 05:35:42,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467722750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:42,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:42,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:35:42,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978600819] [2024-10-11 05:35:42,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:42,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:35:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:42,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:35:42,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:35:42,404 INFO L87 Difference]: Start difference. First operand 4568 states and 6828 transitions. Second operand has 8 states, 8 states have (on average 44.25) internal successors, (354), 7 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:42,867 INFO L93 Difference]: Finished difference Result 7109 states and 10617 transitions. [2024-10-11 05:35:42,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:35:42,868 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.25) internal successors, (354), 7 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 354 [2024-10-11 05:35:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:42,873 INFO L225 Difference]: With dead ends: 7109 [2024-10-11 05:35:42,873 INFO L226 Difference]: Without dead ends: 4576 [2024-10-11 05:35:42,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:35:42,876 INFO L432 NwaCegarLoop]: 1441 mSDtfsCounter, 2668 mSDsluCounter, 5780 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2668 SdHoareTripleChecker+Valid, 7221 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:42,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2668 Valid, 7221 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:35:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2024-10-11 05:35:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 4574. [2024-10-11 05:35:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 4573 states have (on average 1.4944237918215613) internal successors, (6834), 4573 states have internal predecessors, (6834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6834 transitions. [2024-10-11 05:35:42,915 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6834 transitions. Word has length 354 [2024-10-11 05:35:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:42,915 INFO L471 AbstractCegarLoop]: Abstraction has 4574 states and 6834 transitions. [2024-10-11 05:35:42,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.25) internal successors, (354), 7 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6834 transitions. [2024-10-11 05:35:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-10-11 05:35:42,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:42,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:42,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:35:42,919 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:42,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash 906212381, now seen corresponding path program 1 times [2024-10-11 05:35:42,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:42,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89166296] [2024-10-11 05:35:42,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:42,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:44,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:44,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89166296] [2024-10-11 05:35:44,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89166296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:44,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:44,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:35:44,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802702883] [2024-10-11 05:35:44,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:44,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:35:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:35:44,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:35:44,221 INFO L87 Difference]: Start difference. First operand 4574 states and 6834 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:44,289 INFO L93 Difference]: Finished difference Result 7121 states and 10629 transitions. [2024-10-11 05:35:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:35:44,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2024-10-11 05:35:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:44,300 INFO L225 Difference]: With dead ends: 7121 [2024-10-11 05:35:44,304 INFO L226 Difference]: Without dead ends: 4580 [2024-10-11 05:35:44,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:35:44,312 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 3194 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4794 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:44,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4794 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:35:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4580 states. [2024-10-11 05:35:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4580 to 4580. [2024-10-11 05:35:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4580 states, 4579 states have (on average 1.4937759336099585) internal successors, (6840), 4579 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4580 states to 4580 states and 6840 transitions. [2024-10-11 05:35:44,396 INFO L78 Accepts]: Start accepts. Automaton has 4580 states and 6840 transitions. Word has length 355 [2024-10-11 05:35:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:44,397 INFO L471 AbstractCegarLoop]: Abstraction has 4580 states and 6840 transitions. [2024-10-11 05:35:44,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4580 states and 6840 transitions. [2024-10-11 05:35:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-10-11 05:35:44,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:44,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:44,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:35:44,401 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:44,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2107793024, now seen corresponding path program 1 times [2024-10-11 05:35:44,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:44,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54298344] [2024-10-11 05:35:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:44,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:46,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54298344] [2024-10-11 05:35:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54298344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:46,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:46,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:35:46,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928188054] [2024-10-11 05:35:46,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:46,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:35:46,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:46,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:35:46,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:35:46,271 INFO L87 Difference]: Start difference. First operand 4580 states and 6840 transitions. Second operand has 8 states, 8 states have (on average 44.5) internal successors, (356), 7 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:46,466 INFO L93 Difference]: Finished difference Result 7082 states and 10572 transitions. [2024-10-11 05:35:46,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:35:46,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.5) internal successors, (356), 7 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 356 [2024-10-11 05:35:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:46,473 INFO L225 Difference]: With dead ends: 7082 [2024-10-11 05:35:46,473 INFO L226 Difference]: Without dead ends: 4601 [2024-10-11 05:35:46,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-11 05:35:46,478 INFO L432 NwaCegarLoop]: 1580 mSDtfsCounter, 4111 mSDsluCounter, 7900 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4111 SdHoareTripleChecker+Valid, 9480 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:46,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4111 Valid, 9480 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:35:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2024-10-11 05:35:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4583. [2024-10-11 05:35:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 4582 states have (on average 1.4936708860759493) internal successors, (6844), 4582 states have internal predecessors, (6844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 6844 transitions. [2024-10-11 05:35:46,526 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 6844 transitions. Word has length 356 [2024-10-11 05:35:46,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:46,527 INFO L471 AbstractCegarLoop]: Abstraction has 4583 states and 6844 transitions. [2024-10-11 05:35:46,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.5) internal successors, (356), 7 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 6844 transitions. [2024-10-11 05:35:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-10-11 05:35:46,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:46,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:46,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:35:46,531 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:46,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash -597725819, now seen corresponding path program 1 times [2024-10-11 05:35:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:46,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741889938] [2024-10-11 05:35:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:49,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741889938] [2024-10-11 05:35:49,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741889938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:49,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:49,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:35:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621030364] [2024-10-11 05:35:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:49,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:35:49,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:49,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:35:49,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:35:49,210 INFO L87 Difference]: Start difference. First operand 4583 states and 6844 transitions. Second operand has 9 states, 9 states have (on average 39.666666666666664) internal successors, (357), 8 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:49,555 INFO L93 Difference]: Finished difference Result 7082 states and 10571 transitions. [2024-10-11 05:35:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:35:49,556 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 39.666666666666664) internal successors, (357), 8 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 357 [2024-10-11 05:35:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:49,564 INFO L225 Difference]: With dead ends: 7082 [2024-10-11 05:35:49,565 INFO L226 Difference]: Without dead ends: 4601 [2024-10-11 05:35:49,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:35:49,568 INFO L432 NwaCegarLoop]: 1574 mSDtfsCounter, 4106 mSDsluCounter, 7876 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 9450 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:49,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4106 Valid, 9450 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:35:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2024-10-11 05:35:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4587. [2024-10-11 05:35:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4587 states, 4586 states have (on average 1.4934583515045792) internal successors, (6849), 4586 states have internal predecessors, (6849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4587 states to 4587 states and 6849 transitions. [2024-10-11 05:35:49,610 INFO L78 Accepts]: Start accepts. Automaton has 4587 states and 6849 transitions. Word has length 357 [2024-10-11 05:35:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:49,611 INFO L471 AbstractCegarLoop]: Abstraction has 4587 states and 6849 transitions. [2024-10-11 05:35:49,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.666666666666664) internal successors, (357), 8 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4587 states and 6849 transitions. [2024-10-11 05:35:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-11 05:35:49,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:49,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:49,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:35:49,615 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:49,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:49,615 INFO L85 PathProgramCache]: Analyzing trace with hash 214916095, now seen corresponding path program 1 times [2024-10-11 05:35:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:49,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716459616] [2024-10-11 05:35:49,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:49,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:52,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:52,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716459616] [2024-10-11 05:35:52,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716459616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:52,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:52,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:35:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011220820] [2024-10-11 05:35:52,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:52,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:35:52,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:52,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:35:52,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:35:52,171 INFO L87 Difference]: Start difference. First operand 4587 states and 6849 transitions. Second operand has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:52,545 INFO L93 Difference]: Finished difference Result 14873 states and 22163 transitions. [2024-10-11 05:35:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:35:52,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2024-10-11 05:35:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:52,565 INFO L225 Difference]: With dead ends: 14873 [2024-10-11 05:35:52,566 INFO L226 Difference]: Without dead ends: 12297 [2024-10-11 05:35:52,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:35:52,572 INFO L432 NwaCegarLoop]: 2462 mSDtfsCounter, 2231 mSDsluCounter, 7508 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2231 SdHoareTripleChecker+Valid, 9970 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:52,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2231 Valid, 9970 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:35:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12297 states. [2024-10-11 05:35:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12297 to 9651. [2024-10-11 05:35:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9651 states, 9650 states have (on average 1.495440414507772) internal successors, (14431), 9650 states have internal predecessors, (14431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9651 states to 9651 states and 14431 transitions. [2024-10-11 05:35:52,667 INFO L78 Accepts]: Start accepts. Automaton has 9651 states and 14431 transitions. Word has length 358 [2024-10-11 05:35:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:52,667 INFO L471 AbstractCegarLoop]: Abstraction has 9651 states and 14431 transitions. [2024-10-11 05:35:52,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 9651 states and 14431 transitions. [2024-10-11 05:35:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-11 05:35:52,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:52,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:52,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:35:52,677 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:52,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash 16753543, now seen corresponding path program 1 times [2024-10-11 05:35:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254424031] [2024-10-11 05:35:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:55,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:55,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254424031] [2024-10-11 05:35:55,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254424031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:55,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:55,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:35:55,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091316568] [2024-10-11 05:35:55,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:55,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:35:55,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:55,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:35:55,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:35:55,177 INFO L87 Difference]: Start difference. First operand 9651 states and 14431 transitions. Second operand has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:55,594 INFO L93 Difference]: Finished difference Result 20012 states and 29850 transitions. [2024-10-11 05:35:55,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:35:55,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2024-10-11 05:35:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:55,608 INFO L225 Difference]: With dead ends: 20012 [2024-10-11 05:35:55,608 INFO L226 Difference]: Without dead ends: 10473 [2024-10-11 05:35:55,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:35:55,618 INFO L432 NwaCegarLoop]: 2337 mSDtfsCounter, 3865 mSDsluCounter, 8847 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3865 SdHoareTripleChecker+Valid, 11184 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:55,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3865 Valid, 11184 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:35:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10473 states. [2024-10-11 05:35:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10473 to 8235. [2024-10-11 05:35:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8235 states, 8234 states have (on average 1.4946563031333495) internal successors, (12307), 8234 states have internal predecessors, (12307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8235 states to 8235 states and 12307 transitions. [2024-10-11 05:35:55,698 INFO L78 Accepts]: Start accepts. Automaton has 8235 states and 12307 transitions. Word has length 358 [2024-10-11 05:35:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:55,699 INFO L471 AbstractCegarLoop]: Abstraction has 8235 states and 12307 transitions. [2024-10-11 05:35:55,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 8235 states and 12307 transitions. [2024-10-11 05:35:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-10-11 05:35:55,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:55,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:55,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:35:55,705 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:55,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1748493441, now seen corresponding path program 1 times [2024-10-11 05:35:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359115255] [2024-10-11 05:35:55,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:55,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:35:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:35:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:35:58,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:35:58,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359115255] [2024-10-11 05:35:58,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359115255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:35:58,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:35:58,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:35:58,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137384956] [2024-10-11 05:35:58,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:35:58,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:35:58,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:35:58,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:35:58,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:35:58,087 INFO L87 Difference]: Start difference. First operand 8235 states and 12307 transitions. Second operand has 8 states, 8 states have (on average 44.875) internal successors, (359), 7 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:59,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:35:59,507 INFO L93 Difference]: Finished difference Result 15016 states and 22387 transitions. [2024-10-11 05:35:59,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:35:59,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.875) internal successors, (359), 7 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2024-10-11 05:35:59,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:35:59,517 INFO L225 Difference]: With dead ends: 15016 [2024-10-11 05:35:59,517 INFO L226 Difference]: Without dead ends: 8744 [2024-10-11 05:35:59,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-11 05:35:59,524 INFO L432 NwaCegarLoop]: 2355 mSDtfsCounter, 2839 mSDsluCounter, 10533 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 12888 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:35:59,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2839 Valid, 12888 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:35:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8744 states. [2024-10-11 05:35:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8744 to 8734. [2024-10-11 05:35:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8734 states, 8733 states have (on average 1.485400206114737) internal successors, (12972), 8733 states have internal predecessors, (12972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8734 states to 8734 states and 12972 transitions. [2024-10-11 05:35:59,595 INFO L78 Accepts]: Start accepts. Automaton has 8734 states and 12972 transitions. Word has length 359 [2024-10-11 05:35:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:35:59,596 INFO L471 AbstractCegarLoop]: Abstraction has 8734 states and 12972 transitions. [2024-10-11 05:35:59,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.875) internal successors, (359), 7 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:35:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 8734 states and 12972 transitions. [2024-10-11 05:35:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-10-11 05:35:59,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:35:59,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:35:59,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:35:59,602 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:35:59,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:35:59,602 INFO L85 PathProgramCache]: Analyzing trace with hash 698402039, now seen corresponding path program 1 times [2024-10-11 05:35:59,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:35:59,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016564485] [2024-10-11 05:35:59,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:35:59,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:36:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:36:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:36:02,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:36:02,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016564485] [2024-10-11 05:36:02,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016564485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:36:02,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:36:02,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:36:02,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088172098] [2024-10-11 05:36:02,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:36:02,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:36:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:36:02,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:36:02,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:36:02,155 INFO L87 Difference]: Start difference. First operand 8734 states and 12972 transitions. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:36:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:36:02,456 INFO L93 Difference]: Finished difference Result 17943 states and 26661 transitions. [2024-10-11 05:36:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:36:02,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2024-10-11 05:36:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:36:02,465 INFO L225 Difference]: With dead ends: 17943 [2024-10-11 05:36:02,466 INFO L226 Difference]: Without dead ends: 8734 [2024-10-11 05:36:02,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:36:02,473 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 1782 mSDsluCounter, 4938 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 7202 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:36:02,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 7202 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:36:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8734 states. [2024-10-11 05:36:02,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8734 to 5346. [2024-10-11 05:36:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5346 states, 5345 states have (on average 1.475023386342376) internal successors, (7884), 5345 states have internal predecessors, (7884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:36:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5346 states to 5346 states and 7884 transitions. [2024-10-11 05:36:02,531 INFO L78 Accepts]: Start accepts. Automaton has 5346 states and 7884 transitions. Word has length 359 [2024-10-11 05:36:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:36:02,533 INFO L471 AbstractCegarLoop]: Abstraction has 5346 states and 7884 transitions. [2024-10-11 05:36:02,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:36:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 5346 states and 7884 transitions. [2024-10-11 05:36:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-10-11 05:36:02,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:36:02,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:36:02,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:36:02,537 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:36:02,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:36:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 558895491, now seen corresponding path program 1 times [2024-10-11 05:36:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:36:02,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070543910] [2024-10-11 05:36:02,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:36:02,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:36:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:36:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:36:04,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:36:04,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070543910] [2024-10-11 05:36:04,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070543910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:36:04,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:36:04,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:36:04,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110117316] [2024-10-11 05:36:04,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:36:04,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:36:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:36:04,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:36:04,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:36:04,659 INFO L87 Difference]: Start difference. First operand 5346 states and 7884 transitions. Second operand has 7 states, 7 states have (on average 51.42857142857143) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:36:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:36:05,167 INFO L93 Difference]: Finished difference Result 12537 states and 18529 transitions. [2024-10-11 05:36:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:36:05,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.42857142857143) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360 [2024-10-11 05:36:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:36:05,175 INFO L225 Difference]: With dead ends: 12537 [2024-10-11 05:36:05,175 INFO L226 Difference]: Without dead ends: 8950 [2024-10-11 05:36:05,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:36:05,180 INFO L432 NwaCegarLoop]: 1423 mSDtfsCounter, 2612 mSDsluCounter, 5681 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 7104 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:36:05,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 7104 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:36:05,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8950 states. [2024-10-11 05:36:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8950 to 8742. [2024-10-11 05:36:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8742 states, 8741 states have (on average 1.4840407276055372) internal successors, (12972), 8741 states have internal predecessors, (12972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:36:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8742 states to 8742 states and 12972 transitions. [2024-10-11 05:36:05,250 INFO L78 Accepts]: Start accepts. Automaton has 8742 states and 12972 transitions. Word has length 360 [2024-10-11 05:36:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:36:05,250 INFO L471 AbstractCegarLoop]: Abstraction has 8742 states and 12972 transitions. [2024-10-11 05:36:05,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.42857142857143) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:36:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 8742 states and 12972 transitions. [2024-10-11 05:36:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-10-11 05:36:05,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:36:05,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:36:05,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:36:05,257 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:36:05,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:36:05,258 INFO L85 PathProgramCache]: Analyzing trace with hash 690259118, now seen corresponding path program 1 times [2024-10-11 05:36:05,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:36:05,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772539104] [2024-10-11 05:36:05,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:36:05,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:36:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:36:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:36:08,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:36:08,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772539104] [2024-10-11 05:36:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772539104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:36:08,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:36:08,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:36:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034612936] [2024-10-11 05:36:08,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:36:08,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:36:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:36:08,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:36:08,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:36:08,779 INFO L87 Difference]: Start difference. First operand 8742 states and 12972 transitions. Second operand has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:36:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:36:09,679 INFO L93 Difference]: Finished difference Result 23306 states and 34448 transitions. [2024-10-11 05:36:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:36:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360 [2024-10-11 05:36:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:36:09,696 INFO L225 Difference]: With dead ends: 23306 [2024-10-11 05:36:09,696 INFO L226 Difference]: Without dead ends: 16247 [2024-10-11 05:36:09,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-10-11 05:36:09,705 INFO L432 NwaCegarLoop]: 2693 mSDtfsCounter, 2784 mSDsluCounter, 17297 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2784 SdHoareTripleChecker+Valid, 19990 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:36:09,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2784 Valid, 19990 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:36:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16247 states. [2024-10-11 05:36:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16247 to 14182. [2024-10-11 05:36:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14182 states, 14181 states have (on average 1.4879063535716803) internal successors, (21100), 14181 states have internal predecessors, (21100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:36:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14182 states to 14182 states and 21100 transitions. [2024-10-11 05:36:09,923 INFO L78 Accepts]: Start accepts. Automaton has 14182 states and 21100 transitions. Word has length 360 [2024-10-11 05:36:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:36:09,924 INFO L471 AbstractCegarLoop]: Abstraction has 14182 states and 21100 transitions. [2024-10-11 05:36:09,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:36:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 14182 states and 21100 transitions. [2024-10-11 05:36:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-10-11 05:36:09,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:36:09,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:36:09,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:36:09,946 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:36:09,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:36:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1787542276, now seen corresponding path program 1 times [2024-10-11 05:36:09,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:36:09,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607612207] [2024-10-11 05:36:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:36:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:36:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:36:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:36:12,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:36:12,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607612207] [2024-10-11 05:36:12,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607612207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:36:12,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:36:12,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:36:12,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506582646] [2024-10-11 05:36:12,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:36:12,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:36:12,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:36:12,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:36:12,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:36:12,737 INFO L87 Difference]: Start difference. First operand 14182 states and 21100 transitions. Second operand has 7 states, 7 states have (on average 51.57142857142857) internal successors, (361), 6 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)