./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem17_label03.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '89d9992650be4fcd4025f7007fb14b6b521ee1b4b929549cdf6651f6eed1ab75'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label03.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 32bit --witnessprinter.graph.data.programhash 89d9992650be4fcd4025f7007fb14b6b521ee1b4b929549cdf6651f6eed1ab75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:04:05,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:04:05,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 20:04:05,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:04:05,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:04:05,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:04:05,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:04:05,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:04:05,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:04:05,433 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:04:05,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:04:05,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:04:05,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:04:05,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:04:05,435 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:04:05,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:04:05,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:04:05,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:04:05,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:04:05,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:04:05,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:04:05,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:04:05,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:04:05,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:04:05,436 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:04:05,436 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:04:05,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:04:05,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:04:05,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:04:05,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:04:05,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:04:05,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:04:05,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:04:05,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:04:05,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:04:05,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:04:05,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:04:05,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:04:05,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:04:05,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:04:05,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:04:05,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:04:05,438 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 89d9992650be4fcd4025f7007fb14b6b521ee1b4b929549cdf6651f6eed1ab75 [2024-11-06 20:04:05,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:04:05,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:04:05,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:04:05,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:04:05,752 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:04:05,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label03.c [2024-11-06 20:04:07,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:04:07,472 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:04:07,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label03.c [2024-11-06 20:04:07,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b373ffe71/51c10248edf5488f8ca22958ad6ace68/FLAG97e0d1cef [2024-11-06 20:04:07,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b373ffe71/51c10248edf5488f8ca22958ad6ace68 [2024-11-06 20:04:07,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:04:07,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:04:07,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:04:07,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:04:07,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:04:07,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ddcc8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07, skipping insertion in model container [2024-11-06 20:04:07,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:04:07,896 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label03.c[7281,7294] [2024-11-06 20:04:08,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:04:08,309 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:04:08,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label03.c[7281,7294] [2024-11-06 20:04:08,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:04:08,567 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:04:08,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08 WrapperNode [2024-11-06 20:04:08,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:04:08,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:04:08,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:04:08,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:04:08,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:08,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:09,008 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-11-06 20:04:09,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:04:09,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:04:09,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:04:09,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:04:09,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:09,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:09,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:09,250 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 20:04:09,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:09,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:09,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:09,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:09,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:09,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:09,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:04:09,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:04:09,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:04:09,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:04:09,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (1/1) ... [2024-11-06 20:04:09,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:04:09,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:04:09,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 20:04:09,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 20:04:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:04:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:04:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:04:09,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:04:09,591 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:04:09,593 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:04:13,059 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-06 20:04:13,060 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:04:13,094 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:04:13,095 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:04:13,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:04:13 BoogieIcfgContainer [2024-11-06 20:04:13,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:04:13,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:04:13,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:04:13,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:04:13,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:04:07" (1/3) ... [2024-11-06 20:04:13,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c90d95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:04:13, skipping insertion in model container [2024-11-06 20:04:13,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:08" (2/3) ... [2024-11-06 20:04:13,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c90d95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:04:13, skipping insertion in model container [2024-11-06 20:04:13,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:04:13" (3/3) ... [2024-11-06 20:04:13,108 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label03.c [2024-11-06 20:04:13,122 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:04:13,123 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:04:13,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:04:13,211 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;@23039001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:04:13,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:04:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 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-11-06 20:04:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 20:04:13,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:13,227 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] [2024-11-06 20:04:13,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:13,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2024-11-06 20:04:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:13,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045025916] [2024-11-06 20:04:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:13,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:13,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045025916] [2024-11-06 20:04:13,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045025916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:13,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:13,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:04:13,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319629477] [2024-11-06 20:04:13,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:13,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:13,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:13,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:13,628 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 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 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-11-06 20:04:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:16,045 INFO L93 Difference]: Finished difference Result 1644 states and 3029 transitions. [2024-11-06 20:04:16,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:16,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2024-11-06 20:04:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:16,069 INFO L225 Difference]: With dead ends: 1644 [2024-11-06 20:04:16,069 INFO L226 Difference]: Without dead ends: 977 [2024-11-06 20:04:16,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:16,083 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 439 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:16,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 20:04:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-06 20:04:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2024-11-06 20:04:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 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-11-06 20:04:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2024-11-06 20:04:16,186 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 49 [2024-11-06 20:04:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:16,186 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2024-11-06 20:04:16,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-11-06 20:04:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2024-11-06 20:04:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-06 20:04:16,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:16,191 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, 2, 2, 2, 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] [2024-11-06 20:04:16,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:04:16,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:16,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash -172834846, now seen corresponding path program 1 times [2024-11-06 20:04:16,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:16,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161202188] [2024-11-06 20:04:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:16,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:16,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161202188] [2024-11-06 20:04:16,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161202188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:16,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:16,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:04:16,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593392543] [2024-11-06 20:04:16,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:16,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:16,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:16,472 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-11-06 20:04:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:18,505 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2024-11-06 20:04:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:18,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 116 [2024-11-06 20:04:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:18,515 INFO L225 Difference]: With dead ends: 2813 [2024-11-06 20:04:18,515 INFO L226 Difference]: Without dead ends: 1844 [2024-11-06 20:04:18,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:18,519 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:18,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 20:04:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2024-11-06 20:04:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2024-11-06 20:04:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 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-11-06 20:04:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2024-11-06 20:04:18,576 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 116 [2024-11-06 20:04:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:18,576 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2024-11-06 20:04:18,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-11-06 20:04:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2024-11-06 20:04:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-06 20:04:18,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:18,581 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, 2, 2, 2, 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] [2024-11-06 20:04:18,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:04:18,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:18,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash -807304596, now seen corresponding path program 1 times [2024-11-06 20:04:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554589319] [2024-11-06 20:04:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:18,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:18,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554589319] [2024-11-06 20:04:18,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554589319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:18,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030935455] [2024-11-06 20:04:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:18,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:18,845 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-11-06 20:04:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:20,959 INFO L93 Difference]: Finished difference Result 4552 states and 6282 transitions. [2024-11-06 20:04:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:20,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 119 [2024-11-06 20:04:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:20,970 INFO L225 Difference]: With dead ends: 4552 [2024-11-06 20:04:20,971 INFO L226 Difference]: Without dead ends: 2713 [2024-11-06 20:04:20,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:20,974 INFO L432 NwaCegarLoop]: 818 mSDtfsCounter, 458 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:20,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 886 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 20:04:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2024-11-06 20:04:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2711. [2024-11-06 20:04:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2710 states have (on average 1.3003690036900368) internal successors, (3524), 2710 states have internal predecessors, (3524), 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-11-06 20:04:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3524 transitions. [2024-11-06 20:04:21,019 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3524 transitions. Word has length 119 [2024-11-06 20:04:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:21,019 INFO L471 AbstractCegarLoop]: Abstraction has 2711 states and 3524 transitions. [2024-11-06 20:04:21,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-11-06 20:04:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3524 transitions. [2024-11-06 20:04:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-06 20:04:21,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:21,027 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-06 20:04:21,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:04:21,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:21,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash 182092692, now seen corresponding path program 1 times [2024-11-06 20:04:21,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:21,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194924382] [2024-11-06 20:04:21,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 20:04:21,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:21,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194924382] [2024-11-06 20:04:21,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194924382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:21,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:21,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:04:21,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567995409] [2024-11-06 20:04:21,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:21,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:21,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:21,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:21,302 INFO L87 Difference]: Start difference. First operand 2711 states and 3524 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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-11-06 20:04:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:23,062 INFO L93 Difference]: Finished difference Result 7984 states and 10361 transitions. [2024-11-06 20:04:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:23,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 188 [2024-11-06 20:04:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:23,078 INFO L225 Difference]: With dead ends: 7984 [2024-11-06 20:04:23,078 INFO L226 Difference]: Without dead ends: 4421 [2024-11-06 20:04:23,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:23,086 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:23,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 20:04:23,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2024-11-06 20:04:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3571. [2024-11-06 20:04:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3570 states have (on average 1.1775910364145659) internal successors, (4204), 3570 states have internal predecessors, (4204), 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-11-06 20:04:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4204 transitions. [2024-11-06 20:04:23,149 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4204 transitions. Word has length 188 [2024-11-06 20:04:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:23,150 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 4204 transitions. [2024-11-06 20:04:23,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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-11-06 20:04:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4204 transitions. [2024-11-06 20:04:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-06 20:04:23,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:23,154 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-06 20:04:23,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:04:23,154 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:23,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1924874294, now seen corresponding path program 1 times [2024-11-06 20:04:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:23,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907539723] [2024-11-06 20:04:23,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:23,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:23,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907539723] [2024-11-06 20:04:23,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907539723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:23,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:23,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:23,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430041981] [2024-11-06 20:04:23,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:23,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:23,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:23,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:23,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:23,602 INFO L87 Difference]: Start difference. First operand 3571 states and 4204 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 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-11-06 20:04:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:25,177 INFO L93 Difference]: Finished difference Result 9273 states and 11087 transitions. [2024-11-06 20:04:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:25,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 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-11-06 20:04:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:25,192 INFO L225 Difference]: With dead ends: 9273 [2024-11-06 20:04:25,192 INFO L226 Difference]: Without dead ends: 5704 [2024-11-06 20:04:25,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:25,197 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:25,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:04:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2024-11-06 20:04:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 5704. [2024-11-06 20:04:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5704 states, 5703 states have (on average 1.1595651411537786) internal successors, (6613), 5703 states have internal predecessors, (6613), 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-11-06 20:04:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 6613 transitions. [2024-11-06 20:04:25,283 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 6613 transitions. Word has length 201 [2024-11-06 20:04:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:25,284 INFO L471 AbstractCegarLoop]: Abstraction has 5704 states and 6613 transitions. [2024-11-06 20:04:25,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 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-11-06 20:04:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 6613 transitions. [2024-11-06 20:04:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-06 20:04:25,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:25,287 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2024-11-06 20:04:25,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:04:25,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:25,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:25,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1110667493, now seen corresponding path program 1 times [2024-11-06 20:04:25,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:25,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224421067] [2024-11-06 20:04:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:25,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 20:04:25,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:25,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224421067] [2024-11-06 20:04:25,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224421067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:25,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:25,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:25,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443364546] [2024-11-06 20:04:25,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:25,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:25,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:25,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:25,446 INFO L87 Difference]: Start difference. First operand 5704 states and 6613 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-11-06 20:04:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:27,155 INFO L93 Difference]: Finished difference Result 14376 states and 16776 transitions. [2024-11-06 20:04:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:27,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 203 [2024-11-06 20:04:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:27,175 INFO L225 Difference]: With dead ends: 14376 [2024-11-06 20:04:27,176 INFO L226 Difference]: Without dead ends: 8673 [2024-11-06 20:04:27,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:27,182 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 402 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:27,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:04:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8673 states. [2024-11-06 20:04:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8673 to 5677. [2024-11-06 20:04:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 5676 states have (on average 1.1578576462297392) internal successors, (6572), 5676 states have internal predecessors, (6572), 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-11-06 20:04:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 6572 transitions. [2024-11-06 20:04:27,279 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 6572 transitions. Word has length 203 [2024-11-06 20:04:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:27,280 INFO L471 AbstractCegarLoop]: Abstraction has 5677 states and 6572 transitions. [2024-11-06 20:04:27,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-11-06 20:04:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 6572 transitions. [2024-11-06 20:04:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-06 20:04:27,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:27,284 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:27,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:04:27,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:27,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash -145584583, now seen corresponding path program 1 times [2024-11-06 20:04:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687851043] [2024-11-06 20:04:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:27,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-06 20:04:27,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687851043] [2024-11-06 20:04:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687851043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:27,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:27,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844624301] [2024-11-06 20:04:27,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:27,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:27,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:27,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:27,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:27,753 INFO L87 Difference]: Start difference. First operand 5677 states and 6572 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 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-11-06 20:04:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:29,359 INFO L93 Difference]: Finished difference Result 13935 states and 16238 transitions. [2024-11-06 20:04:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:29,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 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 281 [2024-11-06 20:04:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:29,380 INFO L225 Difference]: With dead ends: 13935 [2024-11-06 20:04:29,381 INFO L226 Difference]: Without dead ends: 7832 [2024-11-06 20:04:29,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:29,386 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 495 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:29,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 629 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:04:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7832 states. [2024-11-06 20:04:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7832 to 7402. [2024-11-06 20:04:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7402 states, 7401 states have (on average 1.1638967707066612) internal successors, (8614), 7401 states have internal predecessors, (8614), 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-11-06 20:04:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 8614 transitions. [2024-11-06 20:04:29,496 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 8614 transitions. Word has length 281 [2024-11-06 20:04:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:29,497 INFO L471 AbstractCegarLoop]: Abstraction has 7402 states and 8614 transitions. [2024-11-06 20:04:29,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 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-11-06 20:04:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 8614 transitions. [2024-11-06 20:04:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-06 20:04:29,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:29,502 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:29,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:04:29,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:29,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1693576314, now seen corresponding path program 1 times [2024-11-06 20:04:29,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:29,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952138319] [2024-11-06 20:04:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-06 20:04:29,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:29,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952138319] [2024-11-06 20:04:29,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952138319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:29,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:29,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:29,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094465529] [2024-11-06 20:04:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:29,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:29,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:29,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:29,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:29,702 INFO L87 Difference]: Start difference. First operand 7402 states and 8614 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-11-06 20:04:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:31,244 INFO L93 Difference]: Finished difference Result 19038 states and 22311 transitions. [2024-11-06 20:04:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:31,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 286 [2024-11-06 20:04:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:31,264 INFO L225 Difference]: With dead ends: 19038 [2024-11-06 20:04:31,264 INFO L226 Difference]: Without dead ends: 11213 [2024-11-06 20:04:31,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:31,273 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 379 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:31,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 842 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:04:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11213 states. [2024-11-06 20:04:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11213 to 10363. [2024-11-06 20:04:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10363 states, 10362 states have (on average 1.132117351862575) internal successors, (11731), 10362 states have internal predecessors, (11731), 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-11-06 20:04:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 11731 transitions. [2024-11-06 20:04:31,442 INFO L78 Accepts]: Start accepts. Automaton has 10363 states and 11731 transitions. Word has length 286 [2024-11-06 20:04:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:31,443 INFO L471 AbstractCegarLoop]: Abstraction has 10363 states and 11731 transitions. [2024-11-06 20:04:31,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-11-06 20:04:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 10363 states and 11731 transitions. [2024-11-06 20:04:31,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-06 20:04:31,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:31,448 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:04:31,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:04:31,448 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:31,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:31,453 INFO L85 PathProgramCache]: Analyzing trace with hash -968764252, now seen corresponding path program 1 times [2024-11-06 20:04:31,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:31,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979837162] [2024-11-06 20:04:31,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:31,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:04:31,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:31,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979837162] [2024-11-06 20:04:31,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979837162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:31,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:31,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:31,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001208740] [2024-11-06 20:04:31,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:31,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:31,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:31,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:31,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:31,873 INFO L87 Difference]: Start difference. First operand 10363 states and 11731 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-11-06 20:04:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:33,409 INFO L93 Difference]: Finished difference Result 24567 states and 27907 transitions. [2024-11-06 20:04:33,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:33,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 304 [2024-11-06 20:04:33,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:33,433 INFO L225 Difference]: With dead ends: 24567 [2024-11-06 20:04:33,434 INFO L226 Difference]: Without dead ends: 13774 [2024-11-06 20:04:33,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:33,444 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 444 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:33,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 295 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:04:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13774 states. [2024-11-06 20:04:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13774 to 12918. [2024-11-06 20:04:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12918 states, 12917 states have (on average 1.1388867384067507) internal successors, (14711), 12917 states have internal predecessors, (14711), 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-11-06 20:04:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12918 states to 12918 states and 14711 transitions. [2024-11-06 20:04:33,576 INFO L78 Accepts]: Start accepts. Automaton has 12918 states and 14711 transitions. Word has length 304 [2024-11-06 20:04:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:33,577 INFO L471 AbstractCegarLoop]: Abstraction has 12918 states and 14711 transitions. [2024-11-06 20:04:33,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-11-06 20:04:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12918 states and 14711 transitions. [2024-11-06 20:04:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-06 20:04:33,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:33,584 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:04:33,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 20:04:33,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:33,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1120603921, now seen corresponding path program 1 times [2024-11-06 20:04:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:33,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063431236] [2024-11-06 20:04:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 293 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:34,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063431236] [2024-11-06 20:04:34,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063431236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:04:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096899631] [2024-11-06 20:04:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:34,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:04:34,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:04:34,185 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 20:04:34,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 20:04:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:34,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 20:04:34,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:04:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 236 proven. 82 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-06 20:04:35,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:04:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 236 proven. 82 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-06 20:04:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096899631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 20:04:36,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 20:04:36,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-11-06 20:04:36,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503812418] [2024-11-06 20:04:36,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 20:04:36,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 20:04:36,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:36,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 20:04:36,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-06 20:04:36,058 INFO L87 Difference]: Start difference. First operand 12918 states and 14711 transitions. Second operand has 9 states, 9 states have (on average 84.44444444444444) internal successors, (760), 9 states have internal predecessors, (760), 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-11-06 20:04:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:47,502 INFO L93 Difference]: Finished difference Result 72324 states and 82154 transitions. [2024-11-06 20:04:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 20:04:47,503 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 84.44444444444444) internal successors, (760), 9 states have internal predecessors, (760), 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 309 [2024-11-06 20:04:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:47,600 INFO L225 Difference]: With dead ends: 72324 [2024-11-06 20:04:47,600 INFO L226 Difference]: Without dead ends: 55574 [2024-11-06 20:04:47,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2024-11-06 20:04:47,624 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 10330 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 13439 mSolverCounterSat, 2406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10330 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 15845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2406 IncrementalHoareTripleChecker+Valid, 13439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:47,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10330 Valid, 581 Invalid, 15845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2406 Valid, 13439 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-11-06 20:04:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55574 states. [2024-11-06 20:04:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55574 to 45745. [2024-11-06 20:04:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45745 states, 45744 states have (on average 1.1340066456803077) internal successors, (51874), 45744 states have internal predecessors, (51874), 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-11-06 20:04:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45745 states to 45745 states and 51874 transitions. [2024-11-06 20:04:48,448 INFO L78 Accepts]: Start accepts. Automaton has 45745 states and 51874 transitions. Word has length 309 [2024-11-06 20:04:48,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:48,449 INFO L471 AbstractCegarLoop]: Abstraction has 45745 states and 51874 transitions. [2024-11-06 20:04:48,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.44444444444444) internal successors, (760), 9 states have internal predecessors, (760), 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-11-06 20:04:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 45745 states and 51874 transitions. [2024-11-06 20:04:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-06 20:04:48,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:48,454 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:04:48,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 20:04:48,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-06 20:04:48,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:48,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1219629045, now seen corresponding path program 1 times [2024-11-06 20:04:48,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:48,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285820723] [2024-11-06 20:04:48,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:04:49,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:49,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285820723] [2024-11-06 20:04:49,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285820723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:49,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:49,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:49,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749422310] [2024-11-06 20:04:49,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:49,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:49,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:49,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:49,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:49,002 INFO L87 Difference]: Start difference. First operand 45745 states and 51874 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-11-06 20:04:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:50,477 INFO L93 Difference]: Finished difference Result 89355 states and 101386 transitions. [2024-11-06 20:04:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 336 [2024-11-06 20:04:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:50,530 INFO L225 Difference]: With dead ends: 89355 [2024-11-06 20:04:50,530 INFO L226 Difference]: Without dead ends: 44037 [2024-11-06 20:04:50,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:50,563 INFO L432 NwaCegarLoop]: 671 mSDtfsCounter, 455 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:50,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 736 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:04:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44037 states. [2024-11-06 20:04:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44037 to 43610. [2024-11-06 20:04:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43610 states, 43609 states have (on average 1.1010341901900984) internal successors, (48015), 43609 states have internal predecessors, (48015), 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-11-06 20:04:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43610 states to 43610 states and 48015 transitions. [2024-11-06 20:04:51,474 INFO L78 Accepts]: Start accepts. Automaton has 43610 states and 48015 transitions. Word has length 336 [2024-11-06 20:04:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:51,475 INFO L471 AbstractCegarLoop]: Abstraction has 43610 states and 48015 transitions. [2024-11-06 20:04:51,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-11-06 20:04:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 43610 states and 48015 transitions. [2024-11-06 20:04:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-11-06 20:04:51,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:51,483 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:04:51,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 20:04:51,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:51,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1217593932, now seen corresponding path program 1 times [2024-11-06 20:04:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:51,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850543534] [2024-11-06 20:04:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-06 20:04:52,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:52,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850543534] [2024-11-06 20:04:52,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850543534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:52,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:52,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:52,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262541524] [2024-11-06 20:04:52,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:52,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:52,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:52,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:52,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:52,004 INFO L87 Difference]: Start difference. First operand 43610 states and 48015 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 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-11-06 20:04:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:53,772 INFO L93 Difference]: Finished difference Result 110697 states and 121863 transitions. [2024-11-06 20:04:53,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:53,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 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 396 [2024-11-06 20:04:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:53,836 INFO L225 Difference]: With dead ends: 110697 [2024-11-06 20:04:53,836 INFO L226 Difference]: Without dead ends: 67074 [2024-11-06 20:04:53,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:53,869 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 475 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:53,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 212 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:04:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67074 states. [2024-11-06 20:04:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67074 to 64910. [2024-11-06 20:04:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64910 states, 64909 states have (on average 1.0915589517632378) internal successors, (70852), 64909 states have internal predecessors, (70852), 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-11-06 20:04:54,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64910 states to 64910 states and 70852 transitions. [2024-11-06 20:04:54,583 INFO L78 Accepts]: Start accepts. Automaton has 64910 states and 70852 transitions. Word has length 396 [2024-11-06 20:04:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:54,584 INFO L471 AbstractCegarLoop]: Abstraction has 64910 states and 70852 transitions. [2024-11-06 20:04:54,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 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-11-06 20:04:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 64910 states and 70852 transitions. [2024-11-06 20:04:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-06 20:04:54,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:54,745 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:04:54,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:04:54,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:54,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2020271132, now seen corresponding path program 1 times [2024-11-06 20:04:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:54,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85105281] [2024-11-06 20:04:54,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:54,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-06 20:04:55,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:55,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85105281] [2024-11-06 20:04:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85105281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:55,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:04:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277595973] [2024-11-06 20:04:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:55,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:55,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:55,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:55,017 INFO L87 Difference]: Start difference. First operand 64910 states and 70852 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 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-11-06 20:04:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:56,080 INFO L93 Difference]: Finished difference Result 126827 states and 138388 transitions. [2024-11-06 20:04:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:56,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 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 455 [2024-11-06 20:04:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:56,152 INFO L225 Difference]: With dead ends: 126827 [2024-11-06 20:04:56,152 INFO L226 Difference]: Without dead ends: 62343 [2024-11-06 20:04:56,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:56,181 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 637 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:56,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 102 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 20:04:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62343 states. [2024-11-06 20:04:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62343 to 62332. [2024-11-06 20:04:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62332 states, 62331 states have (on average 1.0897306316279218) internal successors, (67924), 62331 states have internal predecessors, (67924), 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-11-06 20:04:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62332 states to 62332 states and 67924 transitions. [2024-11-06 20:04:56,725 INFO L78 Accepts]: Start accepts. Automaton has 62332 states and 67924 transitions. Word has length 455 [2024-11-06 20:04:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:56,725 INFO L471 AbstractCegarLoop]: Abstraction has 62332 states and 67924 transitions. [2024-11-06 20:04:56,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 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-11-06 20:04:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 62332 states and 67924 transitions. [2024-11-06 20:04:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2024-11-06 20:04:56,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:56,733 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:04:56,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 20:04:56,733 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:56,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1958053970, now seen corresponding path program 1 times [2024-11-06 20:04:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:56,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173363296] [2024-11-06 20:04:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:56,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-11-06 20:04:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:57,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173363296] [2024-11-06 20:04:57,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173363296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:57,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:57,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:04:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910839258] [2024-11-06 20:04:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:57,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:04:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:57,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:04:57,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:04:57,188 INFO L87 Difference]: Start difference. First operand 62332 states and 67924 transitions. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 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-11-06 20:04:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:59,670 INFO L93 Difference]: Finished difference Result 140024 states and 152285 transitions. [2024-11-06 20:04:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:04:59,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 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 495 [2024-11-06 20:04:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:59,754 INFO L225 Difference]: With dead ends: 140024 [2024-11-06 20:04:59,755 INFO L226 Difference]: Without dead ends: 77693 [2024-11-06 20:04:59,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:04:59,793 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 893 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 2700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:59,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 275 Invalid, 2700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 20:04:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77693 states. [2024-11-06 20:05:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77693 to 59337. [2024-11-06 20:05:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59337 states, 59336 states have (on average 1.082361466900364) internal successors, (64223), 59336 states have internal predecessors, (64223), 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-11-06 20:05:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59337 states to 59337 states and 64223 transitions. [2024-11-06 20:05:00,582 INFO L78 Accepts]: Start accepts. Automaton has 59337 states and 64223 transitions. Word has length 495 [2024-11-06 20:05:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:00,582 INFO L471 AbstractCegarLoop]: Abstraction has 59337 states and 64223 transitions. [2024-11-06 20:05:00,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 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-11-06 20:05:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 59337 states and 64223 transitions. [2024-11-06 20:05:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-11-06 20:05:00,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:00,594 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:05:00,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 20:05:00,595 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:00,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash -564339835, now seen corresponding path program 1 times [2024-11-06 20:05:00,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:00,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419677817] [2024-11-06 20:05:00,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:00,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 414 proven. 82 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-06 20:05:01,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:01,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419677817] [2024-11-06 20:05:01,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419677817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:05:01,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507348389] [2024-11-06 20:05:01,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:01,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:05:01,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:05:01,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 20:05:01,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 20:05:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:01,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 20:05:01,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:05:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 414 proven. 82 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-06 20:05:01,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:05:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 496 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-06 20:05:02,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507348389] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:05:02,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:05:02,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-06 20:05:02,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352981193] [2024-11-06 20:05:02,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:02,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:05:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:02,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:05:02,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:05:02,015 INFO L87 Difference]: Start difference. First operand 59337 states and 64223 transitions. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 3 states have internal predecessors, (387), 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-11-06 20:05:04,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:04,457 INFO L93 Difference]: Finished difference Result 147196 states and 159116 transitions. [2024-11-06 20:05:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:05:04,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 3 states have internal predecessors, (387), 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 504 [2024-11-06 20:05:04,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:04,547 INFO L225 Difference]: With dead ends: 147196 [2024-11-06 20:05:04,547 INFO L226 Difference]: Without dead ends: 88286 [2024-11-06 20:05:04,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:05:04,585 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 696 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:04,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 107 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 20:05:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88286 states. [2024-11-06 20:05:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88286 to 83986. [2024-11-06 20:05:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83986 states, 83985 states have (on average 1.0732868964696076) internal successors, (90140), 83985 states have internal predecessors, (90140), 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-11-06 20:05:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83986 states to 83986 states and 90140 transitions. [2024-11-06 20:05:05,601 INFO L78 Accepts]: Start accepts. Automaton has 83986 states and 90140 transitions. Word has length 504 [2024-11-06 20:05:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:05,602 INFO L471 AbstractCegarLoop]: Abstraction has 83986 states and 90140 transitions. [2024-11-06 20:05:05,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 3 states have internal predecessors, (387), 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-11-06 20:05:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 83986 states and 90140 transitions. [2024-11-06 20:05:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2024-11-06 20:05:05,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:05,617 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 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] [2024-11-06 20:05:05,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 20:05:05,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-06 20:05:05,818 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:05,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:05,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1515115607, now seen corresponding path program 1 times [2024-11-06 20:05:05,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:05,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620001183] [2024-11-06 20:05:05,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:05,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 715 proven. 72 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-11-06 20:05:06,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:06,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620001183] [2024-11-06 20:05:06,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620001183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:05:06,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711451219] [2024-11-06 20:05:06,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:06,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:05:06,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:05:06,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 20:05:06,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 20:05:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:06,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 20:05:06,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:05:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 547 proven. 216 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-11-06 20:05:07,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:05:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2024-11-06 20:05:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711451219] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:05:08,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:05:08,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8 [2024-11-06 20:05:08,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106645237] [2024-11-06 20:05:08,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:08,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:08,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:08,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:08,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 20:05:08,139 INFO L87 Difference]: Start difference. First operand 83986 states and 90140 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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-11-06 20:05:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:09,782 INFO L93 Difference]: Finished difference Result 177762 states and 190553 transitions. [2024-11-06 20:05:09,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:09,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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 513 [2024-11-06 20:05:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:09,882 INFO L225 Difference]: With dead ends: 177762 [2024-11-06 20:05:09,882 INFO L226 Difference]: Without dead ends: 94203 [2024-11-06 20:05:09,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 1023 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 20:05:09,934 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 388 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:09,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 765 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:05:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94203 states. [2024-11-06 20:05:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94203 to 90357. [2024-11-06 20:05:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90357 states, 90356 states have (on average 1.0645668245606268) internal successors, (96190), 90356 states have internal predecessors, (96190), 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-11-06 20:05:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90357 states to 90357 states and 96190 transitions. [2024-11-06 20:05:11,042 INFO L78 Accepts]: Start accepts. Automaton has 90357 states and 96190 transitions. Word has length 513 [2024-11-06 20:05:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:11,042 INFO L471 AbstractCegarLoop]: Abstraction has 90357 states and 96190 transitions. [2024-11-06 20:05:11,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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-11-06 20:05:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 90357 states and 96190 transitions. [2024-11-06 20:05:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2024-11-06 20:05:11,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:11,053 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:05:11,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 20:05:11,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:05:11,254 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:11,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:11,254 INFO L85 PathProgramCache]: Analyzing trace with hash 589170808, now seen corresponding path program 1 times [2024-11-06 20:05:11,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:11,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708567553] [2024-11-06 20:05:11,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:11,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-11-06 20:05:12,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708567553] [2024-11-06 20:05:12,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708567553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:12,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:12,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:05:12,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300752642] [2024-11-06 20:05:12,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:12,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:05:12,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:12,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:05:12,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:05:12,003 INFO L87 Difference]: Start difference. First operand 90357 states and 96190 transitions. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:14,757 INFO L93 Difference]: Finished difference Result 214793 states and 228199 transitions. [2024-11-06 20:05:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:05:14,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 519 [2024-11-06 20:05:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:14,899 INFO L225 Difference]: With dead ends: 214793 [2024-11-06 20:05:14,899 INFO L226 Difference]: Without dead ends: 124863 [2024-11-06 20:05:14,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:05:14,963 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 840 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:14,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 186 Invalid, 2777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 2341 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 20:05:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124863 states. [2024-11-06 20:05:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124863 to 117625. [2024-11-06 20:05:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117625 states, 117624 states have (on average 1.0620536625178536) internal successors, (124923), 117624 states have internal predecessors, (124923), 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-11-06 20:05:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117625 states to 117625 states and 124923 transitions. [2024-11-06 20:05:16,668 INFO L78 Accepts]: Start accepts. Automaton has 117625 states and 124923 transitions. Word has length 519 [2024-11-06 20:05:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:16,668 INFO L471 AbstractCegarLoop]: Abstraction has 117625 states and 124923 transitions. [2024-11-06 20:05:16,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 117625 states and 124923 transitions. [2024-11-06 20:05:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2024-11-06 20:05:16,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:16,679 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:05:16,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 20:05:16,679 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:16,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:16,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1068627681, now seen corresponding path program 1 times [2024-11-06 20:05:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:16,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589837405] [2024-11-06 20:05:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:16,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 750 proven. 89 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-11-06 20:05:17,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:17,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589837405] [2024-11-06 20:05:17,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589837405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:05:17,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23069017] [2024-11-06 20:05:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:17,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:05:17,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:05:17,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 20:05:17,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 20:05:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:17,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 20:05:17,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:05:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 750 proven. 89 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-11-06 20:05:17,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:05:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 839 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-11-06 20:05:18,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23069017] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:05:18,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:05:18,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2024-11-06 20:05:18,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319671237] [2024-11-06 20:05:18,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:18,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 20:05:18,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:18,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 20:05:18,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-06 20:05:18,973 INFO L87 Difference]: Start difference. First operand 117625 states and 124923 transitions. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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)