./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.miim.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.miim.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 8c8574ead59a3d6c844f4988721fe479d7d5d492b1ea6dd2e875c5c9834b070c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:26:07,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:26:07,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:26:07,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:26:07,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:26:07,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:26:07,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:26:07,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:26:07,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:26:07,651 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:26:07,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:26:07,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:26:07,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:26:07,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:26:07,653 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:26:07,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:26:07,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:26:07,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:26:07,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:26:07,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:26:07,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:26:07,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:26:07,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:26:07,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:26:07,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:26:07,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:26:07,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:26:07,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:26:07,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:26:07,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:26:07,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:26:07,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:26:07,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:26:07,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:26:07,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:26:07,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:26:07,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:26:07,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:26:07,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:26:07,668 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 -> 8c8574ead59a3d6c844f4988721fe479d7d5d492b1ea6dd2e875c5c9834b070c [2024-10-11 06:26:07,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:26:07,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:26:07,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:26:07,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:26:07,998 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:26:08,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.miim.c [2024-10-11 06:26:09,760 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:26:10,017 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:26:10,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.miim.c [2024-10-11 06:26:10,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/65c365cca/37fcd28fd3a24199bf4d851cb1eb4b82/FLAG1ab76b0f7 [2024-10-11 06:26:10,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/65c365cca/37fcd28fd3a24199bf4d851cb1eb4b82 [2024-10-11 06:26:10,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:26:10,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:26:10,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:26:10,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:26:10,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:26:10,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:10,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257f3744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10, skipping insertion in model container [2024-10-11 06:26:10,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:10,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:26:10,303 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.miim.c[1244,1257] [2024-10-11 06:26:10,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:26:10,538 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:26:10,553 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.miim.c[1244,1257] [2024-10-11 06:26:10,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:26:10,808 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:26:10,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10 WrapperNode [2024-10-11 06:26:10,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:26:10,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:26:10,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:26:10,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:26:10,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:10,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:10,985 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1718 [2024-10-11 06:26:10,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:26:10,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:26:10,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:26:10,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:26:11,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:11,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:11,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:11,136 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-11 06:26:11,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:11,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:11,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:11,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:11,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:11,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:11,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:26:11,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:26:11,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:26:11,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:26:11,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (1/1) ... [2024-10-11 06:26:11,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:26:11,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:26:11,329 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 06:26:11,331 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 06:26:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:26:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:26:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 06:26:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:26:11,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:26:11,635 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:26:11,637 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:26:13,321 INFO L? ?]: Removed 833 outVars from TransFormulas that were not future-live. [2024-10-11 06:26:13,321 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:26:13,384 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:26:13,384 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:26:13,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:26:13 BoogieIcfgContainer [2024-10-11 06:26:13,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:26:13,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:26:13,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:26:13,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:26:13,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:26:10" (1/3) ... [2024-10-11 06:26:13,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfee695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:26:13, skipping insertion in model container [2024-10-11 06:26:13,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:10" (2/3) ... [2024-10-11 06:26:13,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfee695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:26:13, skipping insertion in model container [2024-10-11 06:26:13,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:26:13" (3/3) ... [2024-10-11 06:26:13,398 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.miim.c [2024-10-11 06:26:13,416 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:26:13,417 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:26:13,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:26:13,493 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;@5a27ef93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:26:13,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:26:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 321 states have (on average 1.5015576323987538) internal successors, (482), 322 states have internal predecessors, (482), 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 06:26:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 06:26:13,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:13,518 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] [2024-10-11 06:26:13,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:13,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash -290071548, now seen corresponding path program 1 times [2024-10-11 06:26:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:13,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601693612] [2024-10-11 06:26:13,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:13,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:14,509 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 06:26:14,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:14,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601693612] [2024-10-11 06:26:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601693612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:14,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:14,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:26:14,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163803672] [2024-10-11 06:26:14,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:14,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:26:14,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:14,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:26:14,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:26:14,566 INFO L87 Difference]: Start difference. First operand has 323 states, 321 states have (on average 1.5015576323987538) internal successors, (482), 322 states have internal predecessors, (482), 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 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 06:26:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:14,638 INFO L93 Difference]: Finished difference Result 550 states and 822 transitions. [2024-10-11 06:26:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:26:14,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 74 [2024-10-11 06:26:14,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:14,653 INFO L225 Difference]: With dead ends: 550 [2024-10-11 06:26:14,653 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 06:26:14,657 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 06:26:14,661 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 0 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1426 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 06:26:14,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1426 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:26:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 06:26:14,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-10-11 06:26:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.4922600619195046) internal successors, (482), 323 states have internal predecessors, (482), 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 06:26:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 482 transitions. [2024-10-11 06:26:14,719 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 482 transitions. Word has length 74 [2024-10-11 06:26:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:14,720 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 482 transitions. [2024-10-11 06:26:14,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 06:26:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 482 transitions. [2024-10-11 06:26:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 06:26:14,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:14,726 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] [2024-10-11 06:26:14,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:26:14,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:14,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:14,727 INFO L85 PathProgramCache]: Analyzing trace with hash -400587788, now seen corresponding path program 1 times [2024-10-11 06:26:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:14,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302562633] [2024-10-11 06:26:14,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:14,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:15,044 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 06:26:15,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:15,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302562633] [2024-10-11 06:26:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302562633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:15,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:15,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:26:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375017480] [2024-10-11 06:26:15,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:15,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:26:15,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:15,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:26:15,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:26:15,056 INFO L87 Difference]: Start difference. First operand 324 states and 482 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 06:26:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:15,118 INFO L93 Difference]: Finished difference Result 553 states and 822 transitions. [2024-10-11 06:26:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:26:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 75 [2024-10-11 06:26:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:15,126 INFO L225 Difference]: With dead ends: 553 [2024-10-11 06:26:15,127 INFO L226 Difference]: Without dead ends: 326 [2024-10-11 06:26:15,128 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 06:26:15,129 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 0 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:15,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1423 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:26:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-11 06:26:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-10-11 06:26:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4892307692307691) internal successors, (484), 325 states have internal predecessors, (484), 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 06:26:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2024-10-11 06:26:15,143 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 75 [2024-10-11 06:26:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:15,143 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2024-10-11 06:26:15,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 06:26:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2024-10-11 06:26:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 06:26:15,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:15,146 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] [2024-10-11 06:26:15,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:26:15,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:15,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash -631285027, now seen corresponding path program 1 times [2024-10-11 06:26:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886966291] [2024-10-11 06:26:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:15,782 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 06:26:15,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:15,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886966291] [2024-10-11 06:26:15,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886966291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:15,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:15,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:26:15,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150971586] [2024-10-11 06:26:15,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:15,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:26:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:15,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:26:15,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:26:15,791 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 06:26:15,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:15,843 INFO L93 Difference]: Finished difference Result 555 states and 823 transitions. [2024-10-11 06:26:15,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:26:15,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 76 [2024-10-11 06:26:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:15,845 INFO L225 Difference]: With dead ends: 555 [2024-10-11 06:26:15,845 INFO L226 Difference]: Without dead ends: 326 [2024-10-11 06:26:15,846 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 06:26:15,847 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 26 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1381 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 06:26:15,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1381 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:26:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-11 06:26:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-10-11 06:26:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4861538461538462) internal successors, (483), 325 states have internal predecessors, (483), 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 06:26:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 483 transitions. [2024-10-11 06:26:15,878 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 483 transitions. Word has length 76 [2024-10-11 06:26:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:15,878 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 483 transitions. [2024-10-11 06:26:15,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 06:26:15,879 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 483 transitions. [2024-10-11 06:26:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 06:26:15,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:15,881 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] [2024-10-11 06:26:15,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:26:15,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:15,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:15,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1481079397, now seen corresponding path program 1 times [2024-10-11 06:26:15,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:15,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118989097] [2024-10-11 06:26:15,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:15,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:16,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 06:26:16,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:16,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118989097] [2024-10-11 06:26:16,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118989097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:16,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:16,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:26:16,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305686352] [2024-10-11 06:26:16,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:16,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:26:16,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:16,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:26:16,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:26:16,524 INFO L87 Difference]: Start difference. First operand 326 states and 483 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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 06:26:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:16,655 INFO L93 Difference]: Finished difference Result 585 states and 865 transitions. [2024-10-11 06:26:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:26:16,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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 77 [2024-10-11 06:26:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:16,658 INFO L225 Difference]: With dead ends: 585 [2024-10-11 06:26:16,658 INFO L226 Difference]: Without dead ends: 356 [2024-10-11 06:26:16,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:26:16,659 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 494 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:16,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2810 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:26:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-11 06:26:16,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 355. [2024-10-11 06:26:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.4830508474576272) internal successors, (525), 354 states have internal predecessors, (525), 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 06:26:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 525 transitions. [2024-10-11 06:26:16,669 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 525 transitions. Word has length 77 [2024-10-11 06:26:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:16,670 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 525 transitions. [2024-10-11 06:26:16,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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 06:26:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 525 transitions. [2024-10-11 06:26:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 06:26:16,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:16,671 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] [2024-10-11 06:26:16,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:26:16,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:16,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:16,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1477334516, now seen corresponding path program 1 times [2024-10-11 06:26:16,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:16,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978062696] [2024-10-11 06:26:16,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:16,962 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 06:26:16,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:16,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978062696] [2024-10-11 06:26:16,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978062696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:16,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:16,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:26:16,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313114716] [2024-10-11 06:26:16,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:16,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:26:16,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:16,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:26:16,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:26:16,966 INFO L87 Difference]: Start difference. First operand 355 states and 525 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 06:26:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:17,097 INFO L93 Difference]: Finished difference Result 619 states and 914 transitions. [2024-10-11 06:26:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:26:17,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2024-10-11 06:26:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:17,099 INFO L225 Difference]: With dead ends: 619 [2024-10-11 06:26:17,099 INFO L226 Difference]: Without dead ends: 361 [2024-10-11 06:26:17,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:26:17,101 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 443 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:17,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1394 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:26:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-11 06:26:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-10-11 06:26:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.4805555555555556) internal successors, (533), 360 states have internal predecessors, (533), 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 06:26:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 533 transitions. [2024-10-11 06:26:17,116 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 533 transitions. Word has length 78 [2024-10-11 06:26:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:17,116 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 533 transitions. [2024-10-11 06:26:17,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 06:26:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 533 transitions. [2024-10-11 06:26:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 06:26:17,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:17,118 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] [2024-10-11 06:26:17,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:26:17,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:17,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:17,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1650525690, now seen corresponding path program 1 times [2024-10-11 06:26:17,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:17,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908928178] [2024-10-11 06:26:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:17,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:18,080 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 06:26:18,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908928178] [2024-10-11 06:26:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908928178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:18,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:18,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:26:18,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540721910] [2024-10-11 06:26:18,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:18,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:26:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:26:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:26:18,086 INFO L87 Difference]: Start difference. First operand 361 states and 533 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 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 06:26:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:18,270 INFO L93 Difference]: Finished difference Result 624 states and 920 transitions. [2024-10-11 06:26:18,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:26:18,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 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 78 [2024-10-11 06:26:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:18,273 INFO L225 Difference]: With dead ends: 624 [2024-10-11 06:26:18,273 INFO L226 Difference]: Without dead ends: 366 [2024-10-11 06:26:18,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:26:18,275 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 497 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:18,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2765 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:26:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-11 06:26:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2024-10-11 06:26:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.478021978021978) internal successors, (538), 364 states have internal predecessors, (538), 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 06:26:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 538 transitions. [2024-10-11 06:26:18,284 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 538 transitions. Word has length 78 [2024-10-11 06:26:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:18,285 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 538 transitions. [2024-10-11 06:26:18,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 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 06:26:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 538 transitions. [2024-10-11 06:26:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 06:26:18,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:18,286 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] [2024-10-11 06:26:18,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:26:18,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:18,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1191234394, now seen corresponding path program 1 times [2024-10-11 06:26:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:18,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183429320] [2024-10-11 06:26:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:18,700 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 06:26:18,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:18,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183429320] [2024-10-11 06:26:18,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183429320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:18,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:18,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:26:18,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040628929] [2024-10-11 06:26:18,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:18,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:26:18,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:18,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:26:18,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:26:18,703 INFO L87 Difference]: Start difference. First operand 365 states and 538 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 06:26:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:18,753 INFO L93 Difference]: Finished difference Result 633 states and 931 transitions. [2024-10-11 06:26:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:26:18,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2024-10-11 06:26:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:18,755 INFO L225 Difference]: With dead ends: 633 [2024-10-11 06:26:18,755 INFO L226 Difference]: Without dead ends: 371 [2024-10-11 06:26:18,756 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 06:26:18,756 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 417 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1413 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 06:26:18,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1413 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:26:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-11 06:26:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2024-10-11 06:26:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.4702702702702704) internal successors, (544), 370 states have internal predecessors, (544), 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 06:26:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 544 transitions. [2024-10-11 06:26:18,765 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 544 transitions. Word has length 79 [2024-10-11 06:26:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:18,765 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 544 transitions. [2024-10-11 06:26:18,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 06:26:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 544 transitions. [2024-10-11 06:26:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 06:26:18,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:18,767 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] [2024-10-11 06:26:18,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:26:18,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:18,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash -764651595, now seen corresponding path program 1 times [2024-10-11 06:26:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:18,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888002390] [2024-10-11 06:26:18,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:19,185 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 06:26:19,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888002390] [2024-10-11 06:26:19,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888002390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:19,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:19,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:26:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222067285] [2024-10-11 06:26:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:19,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:26:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:26:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:26:19,188 INFO L87 Difference]: Start difference. First operand 371 states and 544 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 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 06:26:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:19,888 INFO L93 Difference]: Finished difference Result 754 states and 1099 transitions. [2024-10-11 06:26:19,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:26:19,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 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 80 [2024-10-11 06:26:19,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:19,890 INFO L225 Difference]: With dead ends: 754 [2024-10-11 06:26:19,891 INFO L226 Difference]: Without dead ends: 486 [2024-10-11 06:26:19,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:26:19,892 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 741 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:19,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1416 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 06:26:19,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-10-11 06:26:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 392. [2024-10-11 06:26:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.4680306905370843) internal successors, (574), 391 states have internal predecessors, (574), 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 06:26:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 574 transitions. [2024-10-11 06:26:19,900 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 574 transitions. Word has length 80 [2024-10-11 06:26:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:19,901 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 574 transitions. [2024-10-11 06:26:19,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 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 06:26:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 574 transitions. [2024-10-11 06:26:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 06:26:19,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:19,902 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] [2024-10-11 06:26:19,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 06:26:19,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:19,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2109932609, now seen corresponding path program 1 times [2024-10-11 06:26:19,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:19,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193495489] [2024-10-11 06:26:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:19,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:20,288 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 06:26:20,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:20,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193495489] [2024-10-11 06:26:20,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193495489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:20,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:20,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:26:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481718910] [2024-10-11 06:26:20,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:20,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:26:20,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:26:20,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:26:20,291 INFO L87 Difference]: Start difference. First operand 392 states and 574 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 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 06:26:21,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:21,262 INFO L93 Difference]: Finished difference Result 869 states and 1268 transitions. [2024-10-11 06:26:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:26:21,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 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 81 [2024-10-11 06:26:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:21,265 INFO L225 Difference]: With dead ends: 869 [2024-10-11 06:26:21,265 INFO L226 Difference]: Without dead ends: 595 [2024-10-11 06:26:21,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:26:21,267 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1063 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:21,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1948 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 06:26:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-10-11 06:26:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 393. [2024-10-11 06:26:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.4642857142857142) internal successors, (574), 392 states have internal predecessors, (574), 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 06:26:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions. [2024-10-11 06:26:21,276 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 81 [2024-10-11 06:26:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:21,276 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 574 transitions. [2024-10-11 06:26:21,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 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 06:26:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions. [2024-10-11 06:26:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 06:26:21,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:21,278 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] [2024-10-11 06:26:21,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 06:26:21,278 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:21,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:21,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2133624242, now seen corresponding path program 1 times [2024-10-11 06:26:21,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:21,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156866575] [2024-10-11 06:26:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:21,571 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 06:26:21,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156866575] [2024-10-11 06:26:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156866575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:26:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343301364] [2024-10-11 06:26:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:21,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:26:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:26:21,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:26:21,574 INFO L87 Difference]: Start difference. First operand 393 states and 574 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 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 06:26:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:21,714 INFO L93 Difference]: Finished difference Result 719 states and 1040 transitions. [2024-10-11 06:26:21,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:26:21,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 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 82 [2024-10-11 06:26:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:21,716 INFO L225 Difference]: With dead ends: 719 [2024-10-11 06:26:21,717 INFO L226 Difference]: Without dead ends: 440 [2024-10-11 06:26:21,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:26:21,718 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 593 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:21,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 2309 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:26:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-11 06:26:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 394. [2024-10-11 06:26:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.460559796437659) internal successors, (574), 393 states have internal predecessors, (574), 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 06:26:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 574 transitions. [2024-10-11 06:26:21,727 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 574 transitions. Word has length 82 [2024-10-11 06:26:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:21,727 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 574 transitions. [2024-10-11 06:26:21,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 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 06:26:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 574 transitions. [2024-10-11 06:26:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 06:26:21,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:21,729 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] [2024-10-11 06:26:21,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 06:26:21,729 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:21,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash -392826328, now seen corresponding path program 1 times [2024-10-11 06:26:21,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:21,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563653898] [2024-10-11 06:26:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:21,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:22,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 06:26:22,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:22,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563653898] [2024-10-11 06:26:22,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563653898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:22,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:22,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:26:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311457916] [2024-10-11 06:26:22,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:22,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:26:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:26:22,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:26:22,058 INFO L87 Difference]: Start difference. First operand 394 states and 574 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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 06:26:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:22,220 INFO L93 Difference]: Finished difference Result 753 states and 1088 transitions. [2024-10-11 06:26:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:26:22,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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 83 [2024-10-11 06:26:22,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:22,223 INFO L225 Difference]: With dead ends: 753 [2024-10-11 06:26:22,223 INFO L226 Difference]: Without dead ends: 469 [2024-10-11 06:26:22,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:26:22,225 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 675 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 2304 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:22,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 2304 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:26:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-11 06:26:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 395. [2024-10-11 06:26:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 1.4568527918781726) internal successors, (574), 394 states have internal predecessors, (574), 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 06:26:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 574 transitions. [2024-10-11 06:26:22,236 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 574 transitions. Word has length 83 [2024-10-11 06:26:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:22,236 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 574 transitions. [2024-10-11 06:26:22,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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 06:26:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 574 transitions. [2024-10-11 06:26:22,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 06:26:22,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:22,238 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] [2024-10-11 06:26:22,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 06:26:22,238 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:22,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:22,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1644228633, now seen corresponding path program 1 times [2024-10-11 06:26:22,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:22,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409651039] [2024-10-11 06:26:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:22,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:22,495 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 06:26:22,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409651039] [2024-10-11 06:26:22,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409651039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:22,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:22,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:26:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432066586] [2024-10-11 06:26:22,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:22,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:26:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:22,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:26:22,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:26:22,502 INFO L87 Difference]: Start difference. First operand 395 states and 574 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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 06:26:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:22,668 INFO L93 Difference]: Finished difference Result 891 states and 1292 transitions. [2024-10-11 06:26:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:26:22,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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 84 [2024-10-11 06:26:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:22,671 INFO L225 Difference]: With dead ends: 891 [2024-10-11 06:26:22,672 INFO L226 Difference]: Without dead ends: 602 [2024-10-11 06:26:22,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:26:22,674 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1069 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:22,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 2309 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:26:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-10-11 06:26:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 396. [2024-10-11 06:26:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.4531645569620253) internal successors, (574), 395 states have internal predecessors, (574), 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 06:26:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 574 transitions. [2024-10-11 06:26:22,688 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 574 transitions. Word has length 84 [2024-10-11 06:26:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:22,688 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 574 transitions. [2024-10-11 06:26:22,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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 06:26:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 574 transitions. [2024-10-11 06:26:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 06:26:22,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:22,690 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] [2024-10-11 06:26:22,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 06:26:22,690 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:22,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash 965166351, now seen corresponding path program 1 times [2024-10-11 06:26:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:22,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614447313] [2024-10-11 06:26:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:22,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:22,905 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 06:26:22,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:22,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614447313] [2024-10-11 06:26:22,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614447313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:22,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:22,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:26:22,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139100675] [2024-10-11 06:26:22,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:22,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:26:22,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:22,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:26:22,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:26:22,946 INFO L87 Difference]: Start difference. First operand 396 states and 574 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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 06:26:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:23,040 INFO L93 Difference]: Finished difference Result 858 states and 1247 transitions. [2024-10-11 06:26:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:26:23,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2024-10-11 06:26:23,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:23,043 INFO L225 Difference]: With dead ends: 858 [2024-10-11 06:26:23,043 INFO L226 Difference]: Without dead ends: 569 [2024-10-11 06:26:23,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:26:23,046 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 1014 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:23,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1396 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:26:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-11 06:26:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 383. [2024-10-11 06:26:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.455497382198953) internal successors, (556), 382 states have internal predecessors, (556), 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 06:26:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 556 transitions. [2024-10-11 06:26:23,055 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 556 transitions. Word has length 85 [2024-10-11 06:26:23,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:23,056 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 556 transitions. [2024-10-11 06:26:23,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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 06:26:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 556 transitions. [2024-10-11 06:26:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 06:26:23,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:23,058 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:23,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 06:26:23,059 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:23,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:23,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1595289820, now seen corresponding path program 1 times [2024-10-11 06:26:23,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:23,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91075375] [2024-10-11 06:26:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:23,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:23,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91075375] [2024-10-11 06:26:23,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91075375] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:26:23,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325922770] [2024-10-11 06:26:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:23,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:26:23,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:26:23,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:26:23,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 06:26:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:24,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 06:26:24,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:26:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:25,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:26:25,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325922770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:25,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 06:26:25,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 06:26:25,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445888708] [2024-10-11 06:26:25,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:25,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:26:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:26:25,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:26:25,008 INFO L87 Difference]: Start difference. First operand 383 states and 556 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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 06:26:25,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:25,321 INFO L93 Difference]: Finished difference Result 650 states and 946 transitions. [2024-10-11 06:26:25,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:26:25,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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 192 [2024-10-11 06:26:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:25,323 INFO L225 Difference]: With dead ends: 650 [2024-10-11 06:26:25,324 INFO L226 Difference]: Without dead ends: 382 [2024-10-11 06:26:25,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:26:25,325 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 365 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:25,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 585 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:26:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-10-11 06:26:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2024-10-11 06:26:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.4514435695538057) internal successors, (553), 381 states have internal predecessors, (553), 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 06:26:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 553 transitions. [2024-10-11 06:26:25,333 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 553 transitions. Word has length 192 [2024-10-11 06:26:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:25,334 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 553 transitions. [2024-10-11 06:26:25,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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 06:26:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 553 transitions. [2024-10-11 06:26:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 06:26:25,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:25,337 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:25,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 06:26:25,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 06:26:25,543 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:25,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:25,543 INFO L85 PathProgramCache]: Analyzing trace with hash 510199150, now seen corresponding path program 1 times [2024-10-11 06:26:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:25,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778578913] [2024-10-11 06:26:25,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:25,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:27,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:27,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778578913] [2024-10-11 06:26:27,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778578913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:27,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:27,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:26:27,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280061961] [2024-10-11 06:26:27,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:27,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:26:27,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:27,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:26:27,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:26:27,278 INFO L87 Difference]: Start difference. First operand 382 states and 553 transitions. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 5 states have internal predecessors, (193), 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 06:26:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:27,600 INFO L93 Difference]: Finished difference Result 774 states and 1121 transitions. [2024-10-11 06:26:27,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:26:27,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 5 states have internal predecessors, (193), 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 193 [2024-10-11 06:26:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:27,603 INFO L225 Difference]: With dead ends: 774 [2024-10-11 06:26:27,603 INFO L226 Difference]: Without dead ends: 499 [2024-10-11 06:26:27,603 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 06:26:27,604 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 772 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:27,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1665 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:26:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-11 06:26:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 457. [2024-10-11 06:26:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 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 06:26:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 660 transitions. [2024-10-11 06:26:27,615 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 660 transitions. Word has length 193 [2024-10-11 06:26:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:27,616 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 660 transitions. [2024-10-11 06:26:27,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 5 states have internal predecessors, (193), 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 06:26:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 660 transitions. [2024-10-11 06:26:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 06:26:27,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:27,620 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:27,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 06:26:27,621 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:27,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1360544369, now seen corresponding path program 1 times [2024-10-11 06:26:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:27,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132208536] [2024-10-11 06:26:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:29,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132208536] [2024-10-11 06:26:29,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132208536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:29,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:29,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:26:29,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196171088] [2024-10-11 06:26:29,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:29,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:26:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:29,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:26:29,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:26:29,471 INFO L87 Difference]: Start difference. First operand 457 states and 660 transitions. Second operand has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 5 states have internal predecessors, (194), 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 06:26:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:29,906 INFO L93 Difference]: Finished difference Result 912 states and 1316 transitions. [2024-10-11 06:26:29,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:26:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 5 states have internal predecessors, (194), 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 194 [2024-10-11 06:26:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:29,911 INFO L225 Difference]: With dead ends: 912 [2024-10-11 06:26:29,911 INFO L226 Difference]: Without dead ends: 645 [2024-10-11 06:26:29,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:26:29,913 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 1108 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:29,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 1418 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:26:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-11 06:26:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 564. [2024-10-11 06:26:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 1.452930728241563) internal successors, (818), 563 states have internal predecessors, (818), 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 06:26:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 818 transitions. [2024-10-11 06:26:29,927 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 818 transitions. Word has length 194 [2024-10-11 06:26:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:29,928 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 818 transitions. [2024-10-11 06:26:29,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 5 states have internal predecessors, (194), 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 06:26:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 818 transitions. [2024-10-11 06:26:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-11 06:26:29,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:29,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:29,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 06:26:29,931 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:29,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:29,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1351467743, now seen corresponding path program 1 times [2024-10-11 06:26:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:29,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206352342] [2024-10-11 06:26:29,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:32,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206352342] [2024-10-11 06:26:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206352342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:26:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566507231] [2024-10-11 06:26:32,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:32,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:26:32,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:26:32,406 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:26:32,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 06:26:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:33,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 1585 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 06:26:33,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:26:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:34,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:26:34,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566507231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:34,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 06:26:34,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-10-11 06:26:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323767646] [2024-10-11 06:26:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:34,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:26:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:34,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:26:34,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:26:34,042 INFO L87 Difference]: Start difference. First operand 564 states and 818 transitions. Second operand has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 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 06:26:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:34,529 INFO L93 Difference]: Finished difference Result 833 states and 1209 transitions. [2024-10-11 06:26:34,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:26:34,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 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 195 [2024-10-11 06:26:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:34,532 INFO L225 Difference]: With dead ends: 833 [2024-10-11 06:26:34,533 INFO L226 Difference]: Without dead ends: 566 [2024-10-11 06:26:34,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-11 06:26:34,534 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 1140 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:34,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 846 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:26:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-10-11 06:26:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 565. [2024-10-11 06:26:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.452127659574468) internal successors, (819), 564 states have internal predecessors, (819), 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 06:26:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 819 transitions. [2024-10-11 06:26:34,543 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 819 transitions. Word has length 195 [2024-10-11 06:26:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:34,544 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 819 transitions. [2024-10-11 06:26:34,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 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 06:26:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 819 transitions. [2024-10-11 06:26:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 06:26:34,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:34,546 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:34,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 06:26:34,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 06:26:34,747 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:34,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1527902516, now seen corresponding path program 1 times [2024-10-11 06:26:34,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:34,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236785199] [2024-10-11 06:26:34,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:37,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236785199] [2024-10-11 06:26:37,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236785199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:26:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064238884] [2024-10-11 06:26:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:37,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:26:37,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:26:37,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:26:37,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 06:26:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:38,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 06:26:38,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:26:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:39,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:26:39,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064238884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:39,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 06:26:39,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-11 06:26:39,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101134702] [2024-10-11 06:26:39,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:39,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:26:39,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:39,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:26:39,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:26:39,297 INFO L87 Difference]: Start difference. First operand 565 states and 819 transitions. Second operand has 5 states, 5 states have (on average 39.2) internal successors, (196), 4 states have internal predecessors, (196), 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 06:26:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:39,865 INFO L93 Difference]: Finished difference Result 938 states and 1363 transitions. [2024-10-11 06:26:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:26:39,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.2) internal successors, (196), 4 states have internal predecessors, (196), 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 196 [2024-10-11 06:26:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:39,869 INFO L225 Difference]: With dead ends: 938 [2024-10-11 06:26:39,869 INFO L226 Difference]: Without dead ends: 565 [2024-10-11 06:26:39,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-11 06:26:39,870 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 745 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:39,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 838 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 06:26:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-11 06:26:39,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2024-10-11 06:26:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.450354609929078) internal successors, (818), 564 states have internal predecessors, (818), 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 06:26:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 818 transitions. [2024-10-11 06:26:39,881 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 818 transitions. Word has length 196 [2024-10-11 06:26:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:39,881 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 818 transitions. [2024-10-11 06:26:39,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.2) internal successors, (196), 4 states have internal predecessors, (196), 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 06:26:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 818 transitions. [2024-10-11 06:26:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 06:26:39,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:39,884 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:39,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 06:26:40,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:26:40,085 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:40,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1194314258, now seen corresponding path program 1 times [2024-10-11 06:26:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:40,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473191178] [2024-10-11 06:26:40,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:40,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:42,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:42,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473191178] [2024-10-11 06:26:42,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473191178] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:26:42,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809635924] [2024-10-11 06:26:42,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:42,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:26:42,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:26:42,311 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:26:42,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 06:26:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:43,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 1587 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 06:26:43,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:26:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:44,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:26:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:44,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809635924] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:26:44,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:26:44,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2024-10-11 06:26:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475152193] [2024-10-11 06:26:44,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:26:44,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 06:26:44,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:44,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 06:26:44,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-11 06:26:44,790 INFO L87 Difference]: Start difference. First operand 565 states and 818 transitions. Second operand has 19 states, 19 states have (on average 28.57894736842105) internal successors, (543), 18 states have internal predecessors, (543), 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 06:26:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:46,327 INFO L93 Difference]: Finished difference Result 1035 states and 1494 transitions. [2024-10-11 06:26:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 06:26:46,328 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 28.57894736842105) internal successors, (543), 18 states have internal predecessors, (543), 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 197 [2024-10-11 06:26:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:46,333 INFO L225 Difference]: With dead ends: 1035 [2024-10-11 06:26:46,333 INFO L226 Difference]: Without dead ends: 768 [2024-10-11 06:26:46,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2024-10-11 06:26:46,335 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 3224 mSDsluCounter, 2998 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3224 SdHoareTripleChecker+Valid, 3281 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:46,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3224 Valid, 3281 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 06:26:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-10-11 06:26:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 573. [2024-10-11 06:26:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 1.4475524475524475) internal successors, (828), 572 states have internal predecessors, (828), 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 06:26:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 828 transitions. [2024-10-11 06:26:46,351 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 828 transitions. Word has length 197 [2024-10-11 06:26:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:46,352 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 828 transitions. [2024-10-11 06:26:46,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 28.57894736842105) internal successors, (543), 18 states have internal predecessors, (543), 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 06:26:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 828 transitions. [2024-10-11 06:26:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 06:26:46,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:46,354 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:46,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 06:26:46,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:26:46,555 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:46,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash 634876695, now seen corresponding path program 1 times [2024-10-11 06:26:46,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:46,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270942361] [2024-10-11 06:26:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:46,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:51,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:51,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270942361] [2024-10-11 06:26:51,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270942361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:51,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:51,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:26:51,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001234714] [2024-10-11 06:26:51,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:51,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:26:51,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:51,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:26:51,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:26:51,407 INFO L87 Difference]: Start difference. First operand 573 states and 828 transitions. Second operand has 9 states, 9 states have (on average 22.11111111111111) internal successors, (199), 8 states have internal predecessors, (199), 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 06:26:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:51,805 INFO L93 Difference]: Finished difference Result 1119 states and 1612 transitions. [2024-10-11 06:26:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:26:51,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 22.11111111111111) internal successors, (199), 8 states have internal predecessors, (199), 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 199 [2024-10-11 06:26:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:51,810 INFO L225 Difference]: With dead ends: 1119 [2024-10-11 06:26:51,810 INFO L226 Difference]: Without dead ends: 769 [2024-10-11 06:26:51,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-11 06:26:51,812 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 1657 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1657 SdHoareTripleChecker+Valid, 2356 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:51,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1657 Valid, 2356 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:26:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-10-11 06:26:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 691. [2024-10-11 06:26:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 690 states have (on average 1.4333333333333333) internal successors, (989), 690 states have internal predecessors, (989), 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 06:26:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 989 transitions. [2024-10-11 06:26:51,836 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 989 transitions. Word has length 199 [2024-10-11 06:26:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:51,836 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 989 transitions. [2024-10-11 06:26:51,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.11111111111111) internal successors, (199), 8 states have internal predecessors, (199), 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 06:26:51,837 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 989 transitions. [2024-10-11 06:26:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 06:26:51,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:51,839 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:51,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 06:26:51,839 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:51,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1713386834, now seen corresponding path program 1 times [2024-10-11 06:26:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:51,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720684685] [2024-10-11 06:26:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:52,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:52,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720684685] [2024-10-11 06:26:52,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720684685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:52,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:52,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:26:52,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210462293] [2024-10-11 06:26:52,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:52,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:26:52,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:52,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:26:52,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:26:52,537 INFO L87 Difference]: Start difference. First operand 691 states and 989 transitions. Second operand has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 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 06:26:52,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:52,835 INFO L93 Difference]: Finished difference Result 1202 states and 1734 transitions. [2024-10-11 06:26:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:26:52,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 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 200 [2024-10-11 06:26:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:52,838 INFO L225 Difference]: With dead ends: 1202 [2024-10-11 06:26:52,838 INFO L226 Difference]: Without dead ends: 699 [2024-10-11 06:26:52,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:26:52,840 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 45 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:52,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2399 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:26:52,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-11 06:26:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 695. [2024-10-11 06:26:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.430835734870317) internal successors, (993), 694 states have internal predecessors, (993), 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 06:26:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 993 transitions. [2024-10-11 06:26:52,857 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 993 transitions. Word has length 200 [2024-10-11 06:26:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:52,858 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 993 transitions. [2024-10-11 06:26:52,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 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 06:26:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 993 transitions. [2024-10-11 06:26:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 06:26:52,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:52,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:52,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 06:26:52,860 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:52,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:52,860 INFO L85 PathProgramCache]: Analyzing trace with hash 227573422, now seen corresponding path program 1 times [2024-10-11 06:26:52,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:52,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698110157] [2024-10-11 06:26:52,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:52,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:56,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:56,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698110157] [2024-10-11 06:26:56,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698110157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:26:56,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:26:56,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:26:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591769660] [2024-10-11 06:26:56,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:26:56,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:26:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:26:56,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:26:56,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:26:56,342 INFO L87 Difference]: Start difference. First operand 695 states and 993 transitions. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 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 06:26:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:26:56,394 INFO L93 Difference]: Finished difference Result 1067 states and 1533 transitions. [2024-10-11 06:26:56,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:26:56,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 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 200 [2024-10-11 06:26:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:26:56,398 INFO L225 Difference]: With dead ends: 1067 [2024-10-11 06:26:56,398 INFO L226 Difference]: Without dead ends: 701 [2024-10-11 06:26:56,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:26:56,402 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 359 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:26:56,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1403 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:26:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-11 06:26:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2024-10-11 06:26:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 1.427142857142857) internal successors, (999), 700 states have internal predecessors, (999), 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 06:26:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 999 transitions. [2024-10-11 06:26:56,425 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 999 transitions. Word has length 200 [2024-10-11 06:26:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:26:56,426 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 999 transitions. [2024-10-11 06:26:56,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 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 06:26:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 999 transitions. [2024-10-11 06:26:56,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 06:26:56,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:26:56,428 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:56,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 06:26:56,428 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:26:56,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:26:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1873470011, now seen corresponding path program 1 times [2024-10-11 06:26:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:26:56,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755118109] [2024-10-11 06:26:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:26:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:26:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:26:59,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:26:59,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755118109] [2024-10-11 06:26:59,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755118109] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:26:59,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525591813] [2024-10-11 06:26:59,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:26:59,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:26:59,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:26:59,962 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:26:59,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 06:27:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:27:01,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 1595 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 06:27:01,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:27:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:27:01,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:27:01,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525591813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:27:01,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 06:27:01,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2024-10-11 06:27:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686450420] [2024-10-11 06:27:01,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:27:01,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:27:01,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:27:01,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:27:01,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-11 06:27:01,725 INFO L87 Difference]: Start difference. First operand 701 states and 999 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 4 states have internal predecessors, (201), 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 06:27:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:27:02,207 INFO L93 Difference]: Finished difference Result 1136 states and 1629 transitions. [2024-10-11 06:27:02,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:27:02,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 4 states have internal predecessors, (201), 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 201 [2024-10-11 06:27:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:27:02,210 INFO L225 Difference]: With dead ends: 1136 [2024-10-11 06:27:02,210 INFO L226 Difference]: Without dead ends: 620 [2024-10-11 06:27:02,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-10-11 06:27:02,212 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 730 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:27:02,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 852 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:27:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-10-11 06:27:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 579. [2024-10-11 06:27:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 1.439446366782007) internal successors, (832), 578 states have internal predecessors, (832), 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 06:27:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 832 transitions. [2024-10-11 06:27:02,226 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 832 transitions. Word has length 201 [2024-10-11 06:27:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:27:02,227 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 832 transitions. [2024-10-11 06:27:02,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 4 states have internal predecessors, (201), 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 06:27:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 832 transitions. [2024-10-11 06:27:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-11 06:27:02,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:27:02,229 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:27:02,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 06:27:02,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 06:27:02,430 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:27:02,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:27:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1889207613, now seen corresponding path program 1 times [2024-10-11 06:27:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:27:02,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415610691] [2024-10-11 06:27:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:27:02,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:27:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:27:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:27:05,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:27:05,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415610691] [2024-10-11 06:27:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415610691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:27:05,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:27:05,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:27:05,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518724626] [2024-10-11 06:27:05,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:27:05,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:27:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:27:05,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:27:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:27:05,116 INFO L87 Difference]: Start difference. First operand 579 states and 832 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 states have internal predecessors, (202), 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 06:27:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:27:05,170 INFO L93 Difference]: Finished difference Result 945 states and 1363 transitions. [2024-10-11 06:27:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:27:05,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 states have internal predecessors, (202), 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 202 [2024-10-11 06:27:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:27:05,174 INFO L225 Difference]: With dead ends: 945 [2024-10-11 06:27:05,174 INFO L226 Difference]: Without dead ends: 583 [2024-10-11 06:27:05,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:27:05,175 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 358 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:27:05,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1403 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:27:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-11 06:27:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 581. [2024-10-11 06:27:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.4379310344827587) internal successors, (834), 580 states have internal predecessors, (834), 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 06:27:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 834 transitions. [2024-10-11 06:27:05,195 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 834 transitions. Word has length 202 [2024-10-11 06:27:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:27:05,195 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 834 transitions. [2024-10-11 06:27:05,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 states have internal predecessors, (202), 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 06:27:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 834 transitions. [2024-10-11 06:27:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-11 06:27:05,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:27:05,197 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:27:05,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 06:27:05,197 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:27:05,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:27:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1502590308, now seen corresponding path program 1 times [2024-10-11 06:27:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:27:05,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790915008] [2024-10-11 06:27:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:27:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:27:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:27:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:27:09,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:27:09,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790915008] [2024-10-11 06:27:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790915008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:27:09,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:27:09,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 06:27:09,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976254623] [2024-10-11 06:27:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:27:09,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 06:27:09,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:27:09,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 06:27:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:27:09,688 INFO L87 Difference]: Start difference. First operand 581 states and 834 transitions. Second operand has 12 states, 12 states have (on average 16.833333333333332) internal successors, (202), 11 states have internal predecessors, (202), 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 06:27:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:27:10,105 INFO L93 Difference]: Finished difference Result 1522 states and 2185 transitions. [2024-10-11 06:27:10,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 06:27:10,106 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 16.833333333333332) internal successors, (202), 11 states have internal predecessors, (202), 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 202 [2024-10-11 06:27:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:27:10,110 INFO L225 Difference]: With dead ends: 1522 [2024-10-11 06:27:10,111 INFO L226 Difference]: Without dead ends: 1162 [2024-10-11 06:27:10,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-11 06:27:10,113 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 1226 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:27:10,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 3524 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:27:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-10-11 06:27:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 881. [2024-10-11 06:27:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.4227272727272726) internal successors, (1252), 880 states have internal predecessors, (1252), 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 06:27:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1252 transitions. [2024-10-11 06:27:10,151 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1252 transitions. Word has length 202 [2024-10-11 06:27:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:27:10,152 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1252 transitions. [2024-10-11 06:27:10,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.833333333333332) internal successors, (202), 11 states have internal predecessors, (202), 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 06:27:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1252 transitions. [2024-10-11 06:27:10,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-11 06:27:10,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:27:10,155 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:27:10,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 06:27:10,155 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:27:10,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:27:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash -745144713, now seen corresponding path program 1 times [2024-10-11 06:27:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:27:10,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817849408] [2024-10-11 06:27:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:27:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms