./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '5c227f1dec7d604552aae19de1afcc1049837e83568477af6195219b22e2f636'] 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/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c227f1dec7d604552aae19de1afcc1049837e83568477af6195219b22e2f636 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 21:00:04,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 21:00:04,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 21:00:04,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 21:00:04,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 21:00:04,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 21:00:04,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 21:00:04,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 21:00:04,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 21:00:04,557 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 21:00:04,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 21:00:04,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 21:00:04,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 21:00:04,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 21:00:04,558 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 21:00:04,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 21:00:04,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 21:00:04,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 21:00:04,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 21:00:04,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 21:00:04,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 21:00:04,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 21:00:04,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 21:00:04,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 21:00:04,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 21:00:04,560 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 21:00:04,560 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 21:00:04,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:00:04,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 21:00:04,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 21:00:04,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 21:00:04,562 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 ! overflow) ) 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 -> 5c227f1dec7d604552aae19de1afcc1049837e83568477af6195219b22e2f636 [2024-11-07 21:00:04,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 21:00:04,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 21:00:04,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 21:00:04,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 21:00:04,824 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 21:00:04,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-07 21:00:06,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 21:00:06,277 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 21:00:06,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-07 21:00:06,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0c70904e/dec87e0daf284ccfba066ca5bf5ab6e8/FLAG602c3d0fd [2024-11-07 21:00:06,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0c70904e/dec87e0daf284ccfba066ca5bf5ab6e8 [2024-11-07 21:00:06,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 21:00:06,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 21:00:06,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 21:00:06,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 21:00:06,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 21:00:06,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a938b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06, skipping insertion in model container [2024-11-07 21:00:06,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 21:00:06,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:00:06,546 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 21:00:06,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:00:06,623 INFO L204 MainTranslator]: Completed translation [2024-11-07 21:00:06,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06 WrapperNode [2024-11-07 21:00:06,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 21:00:06,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 21:00:06,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 21:00:06,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 21:00:06,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,677 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 428 [2024-11-07 21:00:06,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 21:00:06,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 21:00:06,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 21:00:06,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 21:00:06,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,709 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-07 21:00:06,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 21:00:06,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 21:00:06,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 21:00:06,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 21:00:06,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (1/1) ... [2024-11-07 21:00:06,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:00:06,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:06,780 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-07 21:00:06,783 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-07 21:00:06,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 21:00:06,808 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-07 21:00:06,809 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-07 21:00:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-07 21:00:06,809 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-07 21:00:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-07 21:00:06,809 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-07 21:00:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-07 21:00:06,809 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-07 21:00:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-07 21:00:06,809 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-07 21:00:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 21:00:06,809 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 21:00:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 21:00:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 21:00:06,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 21:00:06,907 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 21:00:06,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 21:00:07,401 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-07 21:00:07,401 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 21:00:07,414 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 21:00:07,414 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 21:00:07,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:00:07 BoogieIcfgContainer [2024-11-07 21:00:07,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 21:00:07,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 21:00:07,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 21:00:07,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 21:00:07,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:00:06" (1/3) ... [2024-11-07 21:00:07,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad6135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:00:07, skipping insertion in model container [2024-11-07 21:00:07,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:06" (2/3) ... [2024-11-07 21:00:07,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad6135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:00:07, skipping insertion in model container [2024-11-07 21:00:07,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:00:07" (3/3) ... [2024-11-07 21:00:07,422 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-07 21:00:07,434 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 21:00:07,435 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-07 21:00:07,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 21:00:07,509 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;@142a3f28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 21:00:07,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-07 21:00:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 153 states have internal predecessors, (225), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 21:00:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 21:00:07,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:07,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:00:07,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:07,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash -324035863, now seen corresponding path program 1 times [2024-11-07 21:00:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:07,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198565219] [2024-11-07 21:00:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:07,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:07,819 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-07 21:00:07,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:07,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198565219] [2024-11-07 21:00:07,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198565219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:07,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:00:07,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 21:00:07,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675246518] [2024-11-07 21:00:07,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:07,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:07,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:07,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 21:00:07,848 INFO L87 Difference]: Start difference. First operand has 193 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 153 states have internal predecessors, (225), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 21:00:07,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:07,976 INFO L93 Difference]: Finished difference Result 402 states and 661 transitions. [2024-11-07 21:00:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:07,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 21:00:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:07,993 INFO L225 Difference]: With dead ends: 402 [2024-11-07 21:00:07,993 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 21:00:07,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 21:00:08,003 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 37 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:08,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 862 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 21:00:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 204. [2024-11-07 21:00:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 151 states have (on average 1.5695364238410596) internal successors, (237), 162 states have internal predecessors, (237), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 21:00:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 313 transitions. [2024-11-07 21:00:08,105 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 313 transitions. Word has length 11 [2024-11-07 21:00:08,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:08,106 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 313 transitions. [2024-11-07 21:00:08,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 21:00:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 313 transitions. [2024-11-07 21:00:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 21:00:08,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:08,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:00:08,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 21:00:08,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:08,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:08,110 INFO L85 PathProgramCache]: Analyzing trace with hash 972050568, now seen corresponding path program 1 times [2024-11-07 21:00:08,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:08,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113055279] [2024-11-07 21:00:08,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:08,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:08,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 21:00:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:08,277 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-07 21:00:08,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:08,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113055279] [2024-11-07 21:00:08,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113055279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:08,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:00:08,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 21:00:08,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604445048] [2024-11-07 21:00:08,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:08,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:08,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:08,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 21:00:08,281 INFO L87 Difference]: Start difference. First operand 204 states and 313 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 21:00:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:08,354 INFO L93 Difference]: Finished difference Result 431 states and 671 transitions. [2024-11-07 21:00:08,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:08,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-07 21:00:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:08,358 INFO L225 Difference]: With dead ends: 431 [2024-11-07 21:00:08,358 INFO L226 Difference]: Without dead ends: 239 [2024-11-07 21:00:08,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 21:00:08,360 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 19 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:08,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 862 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-07 21:00:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2024-11-07 21:00:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 177 states have (on average 1.536723163841808) internal successors, (272), 188 states have internal predecessors, (272), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 21:00:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 358 transitions. [2024-11-07 21:00:08,388 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 358 transitions. Word has length 16 [2024-11-07 21:00:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:08,388 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 358 transitions. [2024-11-07 21:00:08,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 21:00:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 358 transitions. [2024-11-07 21:00:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 21:00:08,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:08,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:00:08,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 21:00:08,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:08,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1383802397, now seen corresponding path program 1 times [2024-11-07 21:00:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:08,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001217873] [2024-11-07 21:00:08,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:08,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 21:00:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:08,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 21:00:08,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001217873] [2024-11-07 21:00:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001217873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60779589] [2024-11-07 21:00:08,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:08,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:08,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:08,607 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-07 21:00:08,609 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-07 21:00:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:08,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 21:00:08,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 21:00:08,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:08,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60779589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:08,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:08,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-07 21:00:08,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026506667] [2024-11-07 21:00:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:08,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 21:00:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:08,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 21:00:08,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:08,817 INFO L87 Difference]: Start difference. First operand 235 states and 358 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 21:00:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:08,863 INFO L93 Difference]: Finished difference Result 239 states and 364 transitions. [2024-11-07 21:00:08,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:08,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-07 21:00:08,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:08,866 INFO L225 Difference]: With dead ends: 239 [2024-11-07 21:00:08,868 INFO L226 Difference]: Without dead ends: 238 [2024-11-07 21:00:08,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:08,869 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 19 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:08,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 824 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-07 21:00:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-07 21:00:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 187 states have internal predecessors, (269), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 21:00:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 355 transitions. [2024-11-07 21:00:08,904 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 355 transitions. Word has length 29 [2024-11-07 21:00:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:08,907 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 355 transitions. [2024-11-07 21:00:08,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 21:00:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 355 transitions. [2024-11-07 21:00:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 21:00:08,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:08,911 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-07 21:00:08,929 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-07 21:00:09,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:09,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:09,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 51799170, now seen corresponding path program 1 times [2024-11-07 21:00:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:09,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534652815] [2024-11-07 21:00:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 21:00:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 21:00:09,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:09,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534652815] [2024-11-07 21:00:09,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534652815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:09,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:00:09,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 21:00:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181338322] [2024-11-07 21:00:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:09,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:09,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 21:00:09,243 INFO L87 Difference]: Start difference. First operand 234 states and 355 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 21:00:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:09,281 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2024-11-07 21:00:09,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:09,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-07 21:00:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:09,287 INFO L225 Difference]: With dead ends: 238 [2024-11-07 21:00:09,288 INFO L226 Difference]: Without dead ends: 237 [2024-11-07 21:00:09,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 21:00:09,289 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 18 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:09,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 826 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-07 21:00:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 204. [2024-11-07 21:00:09,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 153 states have (on average 1.522875816993464) internal successors, (233), 162 states have internal predecessors, (233), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 21:00:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 309 transitions. [2024-11-07 21:00:09,313 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 309 transitions. Word has length 30 [2024-11-07 21:00:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:09,314 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 309 transitions. [2024-11-07 21:00:09,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 21:00:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 309 transitions. [2024-11-07 21:00:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 21:00:09,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:09,320 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2024-11-07 21:00:09,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 21:00:09,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:09,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1290767981, now seen corresponding path program 1 times [2024-11-07 21:00:09,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:09,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402696710] [2024-11-07 21:00:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 21:00:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 21:00:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 21:00:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 21:00:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 21:00:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 21:00:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-07 21:00:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:09,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402696710] [2024-11-07 21:00:09,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402696710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:09,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748039143] [2024-11-07 21:00:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:09,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:09,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:09,650 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-07 21:00:09,652 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-07 21:00:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:09,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:09,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 21:00:09,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748039143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:09,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:09,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 21:00:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733612497] [2024-11-07 21:00:09,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:09,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:09,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:09,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:09,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:09,865 INFO L87 Difference]: Start difference. First operand 204 states and 309 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:09,929 INFO L93 Difference]: Finished difference Result 355 states and 546 transitions. [2024-11-07 21:00:09,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:09,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2024-11-07 21:00:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:09,932 INFO L225 Difference]: With dead ends: 355 [2024-11-07 21:00:09,932 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 21:00:09,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:09,936 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 10 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:09,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 832 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:09,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 21:00:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-07 21:00:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 158 states have (on average 1.5253164556962024) internal successors, (241), 168 states have internal predecessors, (241), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 21:00:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 319 transitions. [2024-11-07 21:00:09,954 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 319 transitions. Word has length 92 [2024-11-07 21:00:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:09,955 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 319 transitions. [2024-11-07 21:00:09,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 319 transitions. [2024-11-07 21:00:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 21:00:09,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:09,958 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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] [2024-11-07 21:00:09,975 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-07 21:00:10,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:10,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:10,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -587374587, now seen corresponding path program 1 times [2024-11-07 21:00:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:10,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666447902] [2024-11-07 21:00:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:10,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 21:00:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 21:00:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 21:00:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 21:00:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 21:00:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-07 21:00:10,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:10,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666447902] [2024-11-07 21:00:10,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666447902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:10,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668155587] [2024-11-07 21:00:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:10,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:10,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:10,427 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-07 21:00:10,438 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-07 21:00:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:10,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 21:00:10,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:10,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668155587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:10,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:10,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 21:00:10,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553586691] [2024-11-07 21:00:10,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:10,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:10,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:10,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:10,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:10,647 INFO L87 Difference]: Start difference. First operand 211 states and 319 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:10,712 INFO L93 Difference]: Finished difference Result 369 states and 565 transitions. [2024-11-07 21:00:10,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:10,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-07 21:00:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:10,714 INFO L225 Difference]: With dead ends: 369 [2024-11-07 21:00:10,714 INFO L226 Difference]: Without dead ends: 218 [2024-11-07 21:00:10,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:10,715 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 8 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:10,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 827 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-07 21:00:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-07 21:00:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 174 states have internal predecessors, (249), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 21:00:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 329 transitions. [2024-11-07 21:00:10,729 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 329 transitions. Word has length 94 [2024-11-07 21:00:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:10,729 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 329 transitions. [2024-11-07 21:00:10,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 329 transitions. [2024-11-07 21:00:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 21:00:10,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:10,732 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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] [2024-11-07 21:00:10,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 21:00:10,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:10,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:10,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:10,937 INFO L85 PathProgramCache]: Analyzing trace with hash -315083275, now seen corresponding path program 1 times [2024-11-07 21:00:10,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:10,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343734893] [2024-11-07 21:00:10,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:10,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 21:00:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 21:00:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 21:00:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-07 21:00:11,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343734893] [2024-11-07 21:00:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343734893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723441838] [2024-11-07 21:00:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:11,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:11,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:11,126 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-07 21:00:11,127 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-07 21:00:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:11,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-07 21:00:11,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:11,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723441838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:11,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:11,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 21:00:11,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100962015] [2024-11-07 21:00:11,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:11,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:11,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:11,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:11,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:11,353 INFO L87 Difference]: Start difference. First operand 218 states and 329 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:11,474 INFO L93 Difference]: Finished difference Result 394 states and 615 transitions. [2024-11-07 21:00:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:11,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2024-11-07 21:00:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:11,477 INFO L225 Difference]: With dead ends: 394 [2024-11-07 21:00:11,477 INFO L226 Difference]: Without dead ends: 236 [2024-11-07 21:00:11,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:11,479 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 39 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:11,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 788 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 21:00:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-07 21:00:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-11-07 21:00:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 175 states have (on average 1.542857142857143) internal successors, (270), 186 states have internal predecessors, (270), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 21:00:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 352 transitions. [2024-11-07 21:00:11,492 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 352 transitions. Word has length 95 [2024-11-07 21:00:11,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:11,492 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 352 transitions. [2024-11-07 21:00:11,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 352 transitions. [2024-11-07 21:00:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 21:00:11,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:11,494 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2024-11-07 21:00:11,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 21:00:11,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-07 21:00:11,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:11,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:11,699 INFO L85 PathProgramCache]: Analyzing trace with hash 316307424, now seen corresponding path program 1 times [2024-11-07 21:00:11,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:11,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140420534] [2024-11-07 21:00:11,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 21:00:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 21:00:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-07 21:00:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140420534] [2024-11-07 21:00:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140420534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:11,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007832921] [2024-11-07 21:00:11,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:11,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:11,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:11,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:11,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 21:00:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:12,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 21:00:12,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007832921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:12,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:12,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 21:00:12,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51994015] [2024-11-07 21:00:12,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:12,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:12,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:12,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:12,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:12,112 INFO L87 Difference]: Start difference. First operand 232 states and 352 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:12,203 INFO L93 Difference]: Finished difference Result 469 states and 727 transitions. [2024-11-07 21:00:12,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-11-07 21:00:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:12,206 INFO L225 Difference]: With dead ends: 469 [2024-11-07 21:00:12,207 INFO L226 Difference]: Without dead ends: 256 [2024-11-07 21:00:12,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:12,211 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 21 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:12,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 808 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 21:00:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-07 21:00:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-11-07 21:00:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 195 states have (on average 1.558974358974359) internal successors, (304), 206 states have internal predecessors, (304), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 21:00:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 390 transitions. [2024-11-07 21:00:12,227 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 390 transitions. Word has length 98 [2024-11-07 21:00:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:12,227 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 390 transitions. [2024-11-07 21:00:12,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 390 transitions. [2024-11-07 21:00:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 21:00:12,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:12,233 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2024-11-07 21:00:12,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 21:00:12,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:12,434 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:12,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash 587919294, now seen corresponding path program 1 times [2024-11-07 21:00:12,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:12,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973405157] [2024-11-07 21:00:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:12,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 21:00:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-07 21:00:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:12,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973405157] [2024-11-07 21:00:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973405157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:12,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418393633] [2024-11-07 21:00:12,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:12,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:12,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:12,604 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:12,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 21:00:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:12,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-07 21:00:12,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:12,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418393633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:12,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:12,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 21:00:12,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093949898] [2024-11-07 21:00:12,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:12,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:12,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:12,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:12,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:12,797 INFO L87 Difference]: Start difference. First operand 256 states and 390 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:12,868 INFO L93 Difference]: Finished difference Result 513 states and 792 transitions. [2024-11-07 21:00:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:12,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-11-07 21:00:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:12,871 INFO L225 Difference]: With dead ends: 513 [2024-11-07 21:00:12,871 INFO L226 Difference]: Without dead ends: 276 [2024-11-07 21:00:12,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:12,873 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 19 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:12,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 795 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:12,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-07 21:00:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-07 21:00:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 211 states have (on average 1.5639810426540284) internal successors, (330), 222 states have internal predecessors, (330), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 21:00:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 420 transitions. [2024-11-07 21:00:12,904 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 420 transitions. Word has length 100 [2024-11-07 21:00:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:12,904 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 420 transitions. [2024-11-07 21:00:12,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 420 transitions. [2024-11-07 21:00:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 21:00:12,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:12,908 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2024-11-07 21:00:12,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 21:00:13,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-07 21:00:13,109 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:13,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:13,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1416958404, now seen corresponding path program 1 times [2024-11-07 21:00:13,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:13,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871724505] [2024-11-07 21:00:13,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:13,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 21:00:13,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871724505] [2024-11-07 21:00:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871724505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997120817] [2024-11-07 21:00:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:13,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:13,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:13,312 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:13,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 21:00:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:13,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-07 21:00:13,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:13,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997120817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:13,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:13,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131919092] [2024-11-07 21:00:13,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:13,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:13,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:13,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:13,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:13,503 INFO L87 Difference]: Start difference. First operand 276 states and 420 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:13,539 INFO L93 Difference]: Finished difference Result 284 states and 435 transitions. [2024-11-07 21:00:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:13,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-11-07 21:00:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:13,542 INFO L225 Difference]: With dead ends: 284 [2024-11-07 21:00:13,542 INFO L226 Difference]: Without dead ends: 283 [2024-11-07 21:00:13,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:13,544 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 12 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:13,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 815 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-07 21:00:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2024-11-07 21:00:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 211 states have (on average 1.5592417061611374) internal successors, (329), 221 states have internal predecessors, (329), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 21:00:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 419 transitions. [2024-11-07 21:00:13,569 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 419 transitions. Word has length 101 [2024-11-07 21:00:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:13,569 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 419 transitions. [2024-11-07 21:00:13,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 419 transitions. [2024-11-07 21:00:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 21:00:13,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:13,572 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2024-11-07 21:00:13,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 21:00:13,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:13,774 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:13,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:13,775 INFO L85 PathProgramCache]: Analyzing trace with hash 976037875, now seen corresponding path program 1 times [2024-11-07 21:00:13,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:13,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359861463] [2024-11-07 21:00:13,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:13,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 21:00:13,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359861463] [2024-11-07 21:00:13,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359861463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063433833] [2024-11-07 21:00:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:13,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:13,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:13,958 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:13,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 21:00:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:14,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-07 21:00:14,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:14,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063433833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:14,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:14,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:14,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414963560] [2024-11-07 21:00:14,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:14,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:14,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:14,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:14,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:14,157 INFO L87 Difference]: Start difference. First operand 275 states and 419 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:14,197 INFO L93 Difference]: Finished difference Result 470 states and 720 transitions. [2024-11-07 21:00:14,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:14,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-11-07 21:00:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:14,200 INFO L225 Difference]: With dead ends: 470 [2024-11-07 21:00:14,201 INFO L226 Difference]: Without dead ends: 285 [2024-11-07 21:00:14,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:14,202 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 11 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:14,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 846 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-07 21:00:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-07 21:00:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 220 states have (on average 1.5545454545454545) internal successors, (342), 229 states have internal predecessors, (342), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 21:00:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 436 transitions. [2024-11-07 21:00:14,221 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 436 transitions. Word has length 102 [2024-11-07 21:00:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:14,221 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 436 transitions. [2024-11-07 21:00:14,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 21:00:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 436 transitions. [2024-11-07 21:00:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 21:00:14,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:14,223 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2024-11-07 21:00:14,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 21:00:14,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:14,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:14,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash -686130286, now seen corresponding path program 1 times [2024-11-07 21:00:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059496581] [2024-11-07 21:00:14,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:14,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-07 21:00:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059496581] [2024-11-07 21:00:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059496581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395657029] [2024-11-07 21:00:14,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:14,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:14,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:14,647 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:14,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 21:00:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:14,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-07 21:00:14,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:14,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395657029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:14,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:14,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967419750] [2024-11-07 21:00:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:14,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:14,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:14,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:14,840 INFO L87 Difference]: Start difference. First operand 285 states and 436 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 21:00:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:14,881 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2024-11-07 21:00:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:14,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-07 21:00:14,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:14,884 INFO L225 Difference]: With dead ends: 296 [2024-11-07 21:00:14,884 INFO L226 Difference]: Without dead ends: 295 [2024-11-07 21:00:14,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:14,885 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 10 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:14,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 842 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-07 21:00:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 286. [2024-11-07 21:00:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.5520361990950227) internal successors, (343), 230 states have internal predecessors, (343), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 21:00:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 437 transitions. [2024-11-07 21:00:14,899 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 437 transitions. Word has length 109 [2024-11-07 21:00:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:14,900 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 437 transitions. [2024-11-07 21:00:14,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 21:00:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 437 transitions. [2024-11-07 21:00:14,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 21:00:14,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:14,902 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2024-11-07 21:00:14,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-07 21:00:15,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:15,103 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:15,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:15,103 INFO L85 PathProgramCache]: Analyzing trace with hash 204797937, now seen corresponding path program 1 times [2024-11-07 21:00:15,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:15,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653604321] [2024-11-07 21:00:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-07 21:00:15,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:15,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653604321] [2024-11-07 21:00:15,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653604321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:15,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751218919] [2024-11-07 21:00:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:15,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:15,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:15,309 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:15,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-07 21:00:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:15,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-07 21:00:15,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751218919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:15,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:15,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268184369] [2024-11-07 21:00:15,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:15,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:15,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:15,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:15,527 INFO L87 Difference]: Start difference. First operand 286 states and 437 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 21:00:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:15,568 INFO L93 Difference]: Finished difference Result 288 states and 439 transitions. [2024-11-07 21:00:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:15,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-07 21:00:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:15,571 INFO L225 Difference]: With dead ends: 288 [2024-11-07 21:00:15,571 INFO L226 Difference]: Without dead ends: 287 [2024-11-07 21:00:15,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:15,572 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 9 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:15,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 857 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-07 21:00:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-07 21:00:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 222 states have (on average 1.5495495495495495) internal successors, (344), 231 states have internal predecessors, (344), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 21:00:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 438 transitions. [2024-11-07 21:00:15,587 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 438 transitions. Word has length 110 [2024-11-07 21:00:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:15,587 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 438 transitions. [2024-11-07 21:00:15,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 21:00:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 438 transitions. [2024-11-07 21:00:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 21:00:15,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:15,589 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2024-11-07 21:00:15,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-07 21:00:15,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 21:00:15,790 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:15,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:15,791 INFO L85 PathProgramCache]: Analyzing trace with hash -282600266, now seen corresponding path program 1 times [2024-11-07 21:00:15,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:15,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185284201] [2024-11-07 21:00:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:15,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 21:00:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-07 21:00:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185284201] [2024-11-07 21:00:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185284201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401082600] [2024-11-07 21:00:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:15,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:15,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:15,958 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:15,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-07 21:00:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 21:00:16,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-07 21:00:16,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:16,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401082600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:16,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:16,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-07 21:00:16,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671120909] [2024-11-07 21:00:16,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:16,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 21:00:16,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:16,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 21:00:16,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:16,184 INFO L87 Difference]: Start difference. First operand 287 states and 438 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 21:00:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:16,230 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2024-11-07 21:00:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:16,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2024-11-07 21:00:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:16,233 INFO L225 Difference]: With dead ends: 292 [2024-11-07 21:00:16,233 INFO L226 Difference]: Without dead ends: 291 [2024-11-07 21:00:16,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:16,234 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 12 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:16,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1071 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:16,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-07 21:00:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 286. [2024-11-07 21:00:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 222 states have (on average 1.545045045045045) internal successors, (343), 230 states have internal predecessors, (343), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 21:00:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 437 transitions. [2024-11-07 21:00:16,251 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 437 transitions. Word has length 111 [2024-11-07 21:00:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:16,251 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 437 transitions. [2024-11-07 21:00:16,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 21:00:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 437 transitions. [2024-11-07 21:00:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 21:00:16,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:16,254 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2024-11-07 21:00:16,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-07 21:00:16,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-07 21:00:16,455 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:16,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash -170673331, now seen corresponding path program 1 times [2024-11-07 21:00:16,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:16,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227050376] [2024-11-07 21:00:16,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 21:00:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-07 21:00:16,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:16,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227050376] [2024-11-07 21:00:16,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227050376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:16,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422373222] [2024-11-07 21:00:16,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:16,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:16,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:16,623 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:16,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-07 21:00:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 21:00:16,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-07 21:00:16,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:16,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422373222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:16,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:16,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-07 21:00:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842324889] [2024-11-07 21:00:16,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:16,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 21:00:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:16,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 21:00:16,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 21:00:16,841 INFO L87 Difference]: Start difference. First operand 286 states and 437 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 21:00:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:16,901 INFO L93 Difference]: Finished difference Result 489 states and 751 transitions. [2024-11-07 21:00:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 21:00:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2024-11-07 21:00:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:16,907 INFO L225 Difference]: With dead ends: 489 [2024-11-07 21:00:16,907 INFO L226 Difference]: Without dead ends: 293 [2024-11-07 21:00:16,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 21:00:16,909 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 20 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:16,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1340 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-07 21:00:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2024-11-07 21:00:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 225 states have (on average 1.551111111111111) internal successors, (349), 232 states have internal predecessors, (349), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 21:00:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 445 transitions. [2024-11-07 21:00:16,923 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 445 transitions. Word has length 112 [2024-11-07 21:00:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:16,924 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 445 transitions. [2024-11-07 21:00:16,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 21:00:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 445 transitions. [2024-11-07 21:00:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 21:00:16,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:16,926 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 21:00:16,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-07 21:00:17,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:17,127 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:17,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:17,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2058156192, now seen corresponding path program 1 times [2024-11-07 21:00:17,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:17,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638162748] [2024-11-07 21:00:17,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:17,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 21:00:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 21:00:17,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:17,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638162748] [2024-11-07 21:00:17,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638162748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:17,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160497840] [2024-11-07 21:00:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:17,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:17,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:17,294 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:17,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-07 21:00:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:17,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-07 21:00:17,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:17,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160497840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:17,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:17,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:17,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455308202] [2024-11-07 21:00:17,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:17,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:17,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:17,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:17,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:17,490 INFO L87 Difference]: Start difference. First operand 289 states and 445 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 21:00:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:17,530 INFO L93 Difference]: Finished difference Result 298 states and 460 transitions. [2024-11-07 21:00:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:17,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-11-07 21:00:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:17,533 INFO L225 Difference]: With dead ends: 298 [2024-11-07 21:00:17,533 INFO L226 Difference]: Without dead ends: 297 [2024-11-07 21:00:17,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:17,534 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 8 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:17,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 851 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:17,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-07 21:00:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 290. [2024-11-07 21:00:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 226 states have (on average 1.5486725663716814) internal successors, (350), 233 states have internal predecessors, (350), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 21:00:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-11-07 21:00:17,548 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 117 [2024-11-07 21:00:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:17,548 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-11-07 21:00:17,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 21:00:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-11-07 21:00:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 21:00:17,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:17,550 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 21:00:17,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-07 21:00:17,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:17,752 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:17,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:17,752 INFO L85 PathProgramCache]: Analyzing trace with hash -621667153, now seen corresponding path program 1 times [2024-11-07 21:00:17,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:17,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127729605] [2024-11-07 21:00:17,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:17,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 21:00:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 21:00:17,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:17,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127729605] [2024-11-07 21:00:17,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127729605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:17,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526765563] [2024-11-07 21:00:17,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:17,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:17,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:17,909 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:17,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-07 21:00:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:18,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-07 21:00:18,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526765563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:18,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:18,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613110427] [2024-11-07 21:00:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:18,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:18,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:18,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:18,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:18,114 INFO L87 Difference]: Start difference. First operand 290 states and 446 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 21:00:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:18,152 INFO L93 Difference]: Finished difference Result 293 states and 449 transitions. [2024-11-07 21:00:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:18,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-11-07 21:00:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:18,155 INFO L225 Difference]: With dead ends: 293 [2024-11-07 21:00:18,155 INFO L226 Difference]: Without dead ends: 292 [2024-11-07 21:00:18,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:18,156 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 7 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:18,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 851 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-07 21:00:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2024-11-07 21:00:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.5462555066079295) internal successors, (351), 234 states have internal predecessors, (351), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 21:00:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 447 transitions. [2024-11-07 21:00:18,168 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 447 transitions. Word has length 118 [2024-11-07 21:00:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:18,168 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 447 transitions. [2024-11-07 21:00:18,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 21:00:18,168 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 447 transitions. [2024-11-07 21:00:18,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 21:00:18,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:18,170 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 21:00:18,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-07 21:00:18,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 21:00:18,371 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:18,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash -43452988, now seen corresponding path program 1 times [2024-11-07 21:00:18,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:18,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991991599] [2024-11-07 21:00:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 21:00:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 21:00:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 21:00:18,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991991599] [2024-11-07 21:00:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991991599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739323666] [2024-11-07 21:00:18,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:18,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:18,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:18,516 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:18,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-07 21:00:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 21:00:18,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-07 21:00:18,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739323666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:18,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-07 21:00:18,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063682278] [2024-11-07 21:00:18,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:18,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 21:00:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:18,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 21:00:18,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:18,763 INFO L87 Difference]: Start difference. First operand 291 states and 447 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 21:00:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:18,811 INFO L93 Difference]: Finished difference Result 299 states and 461 transitions. [2024-11-07 21:00:18,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:18,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-11-07 21:00:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:18,814 INFO L225 Difference]: With dead ends: 299 [2024-11-07 21:00:18,814 INFO L226 Difference]: Without dead ends: 298 [2024-11-07 21:00:18,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:18,814 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 10 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:18,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1072 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-07 21:00:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 292. [2024-11-07 21:00:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.543859649122807) internal successors, (352), 235 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 21:00:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 448 transitions. [2024-11-07 21:00:18,827 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 448 transitions. Word has length 119 [2024-11-07 21:00:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:18,828 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 448 transitions. [2024-11-07 21:00:18,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 21:00:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 448 transitions. [2024-11-07 21:00:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 21:00:18,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:18,830 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 21:00:18,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-07 21:00:19,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 21:00:19,031 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:19,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:19,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1625366468, now seen corresponding path program 1 times [2024-11-07 21:00:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:19,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849224327] [2024-11-07 21:00:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:19,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 21:00:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 21:00:19,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:19,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849224327] [2024-11-07 21:00:19,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849224327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:19,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559049926] [2024-11-07 21:00:19,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:19,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:19,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:19,180 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:19,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-07 21:00:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 21:00:19,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-07 21:00:19,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:19,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559049926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:19,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:19,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-07 21:00:19,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436988189] [2024-11-07 21:00:19,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:19,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 21:00:19,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:19,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 21:00:19,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:19,394 INFO L87 Difference]: Start difference. First operand 292 states and 448 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 21:00:19,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:19,442 INFO L93 Difference]: Finished difference Result 300 states and 462 transitions. [2024-11-07 21:00:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:19,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-11-07 21:00:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:19,444 INFO L225 Difference]: With dead ends: 300 [2024-11-07 21:00:19,445 INFO L226 Difference]: Without dead ends: 299 [2024-11-07 21:00:19,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:19,446 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 12 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:19,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1115 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-07 21:00:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 290. [2024-11-07 21:00:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 227 states have (on average 1.5418502202643172) internal successors, (350), 233 states have internal predecessors, (350), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 21:00:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-11-07 21:00:19,460 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 119 [2024-11-07 21:00:19,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:19,460 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-11-07 21:00:19,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 21:00:19,461 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-11-07 21:00:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 21:00:19,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:19,463 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 21:00:19,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-07 21:00:19,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:19,664 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:19,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1347042293, now seen corresponding path program 1 times [2024-11-07 21:00:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:19,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592230160] [2024-11-07 21:00:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 21:00:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 21:00:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 21:00:19,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592230160] [2024-11-07 21:00:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592230160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405107380] [2024-11-07 21:00:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:19,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:19,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:19,843 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:19,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-07 21:00:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 21:00:20,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-07 21:00:20,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:20,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405107380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:20,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:20,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-07 21:00:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119724477] [2024-11-07 21:00:20,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:20,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 21:00:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 21:00:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 21:00:20,107 INFO L87 Difference]: Start difference. First operand 290 states and 446 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 21:00:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:20,159 INFO L93 Difference]: Finished difference Result 295 states and 452 transitions. [2024-11-07 21:00:20,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 21:00:20,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2024-11-07 21:00:20,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:20,163 INFO L225 Difference]: With dead ends: 295 [2024-11-07 21:00:20,163 INFO L226 Difference]: Without dead ends: 294 [2024-11-07 21:00:20,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 21:00:20,164 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 18 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:20,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1348 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:20,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-07 21:00:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2024-11-07 21:00:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 227 states have (on average 1.5418502202643172) internal successors, (350), 233 states have internal predecessors, (350), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 21:00:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-11-07 21:00:20,183 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 120 [2024-11-07 21:00:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:20,183 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-11-07 21:00:20,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 21:00:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-11-07 21:00:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 21:00:20,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:20,186 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 21:00:20,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-07 21:00:20,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:20,391 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:20,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:20,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1153246709, now seen corresponding path program 1 times [2024-11-07 21:00:20,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:20,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922151958] [2024-11-07 21:00:20,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:20,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 21:00:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 21:00:20,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:20,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922151958] [2024-11-07 21:00:20,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922151958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:20,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595150060] [2024-11-07 21:00:20,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:20,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:20,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:20,517 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:20,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-07 21:00:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 21:00:20,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-07 21:00:20,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:20,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595150060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:20,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:20,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-07 21:00:20,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221842816] [2024-11-07 21:00:20,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:20,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 21:00:20,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:20,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 21:00:20,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 21:00:20,771 INFO L87 Difference]: Start difference. First operand 290 states and 446 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 21:00:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:20,839 INFO L93 Difference]: Finished difference Result 505 states and 777 transitions. [2024-11-07 21:00:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 21:00:20,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2024-11-07 21:00:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:20,844 INFO L225 Difference]: With dead ends: 505 [2024-11-07 21:00:20,844 INFO L226 Difference]: Without dead ends: 305 [2024-11-07 21:00:20,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 21:00:20,846 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 16 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:20,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1418 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 21:00:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-07 21:00:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 292. [2024-11-07 21:00:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.537117903930131) internal successors, (352), 235 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 21:00:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 448 transitions. [2024-11-07 21:00:20,858 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 448 transitions. Word has length 120 [2024-11-07 21:00:20,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:20,859 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 448 transitions. [2024-11-07 21:00:20,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 21:00:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 448 transitions. [2024-11-07 21:00:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 21:00:20,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:20,861 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 21:00:20,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-07 21:00:21,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:21,062 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 21:00:21,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:21,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1840912999, now seen corresponding path program 1 times [2024-11-07 21:00:21,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:21,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906611182] [2024-11-07 21:00:21,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:21,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 21:00:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 21:00:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 21:00:21,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:21,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906611182] [2024-11-07 21:00:21,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906611182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:21,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565445988] [2024-11-07 21:00:21,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:21,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:21,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:21,192 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 21:00:21,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-07 21:00:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 21:00:21,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-07 21:00:21,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:21,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565445988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:21,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:21,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-11-07 21:00:21,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265140832] [2024-11-07 21:00:21,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:21,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 21:00:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:21,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 21:00:21,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-07 21:00:21,434 INFO L87 Difference]: Start difference. First operand 292 states and 448 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-07 21:00:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:21,520 INFO L93 Difference]: Finished difference Result 306 states and 473 transitions. [2024-11-07 21:00:21,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 21:00:21,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 122 [2024-11-07 21:00:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:21,524 INFO L225 Difference]: With dead ends: 306 [2024-11-07 21:00:21,524 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 21:00:21,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-07 21:00:21,527 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 28 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:21,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1680 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 21:00:21,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 21:00:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 21:00:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-07 21:00:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 21:00:21,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2024-11-07 21:00:21,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:21,528 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 21:00:21,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-07 21:00:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 21:00:21,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 21:00:21,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-07 21:00:21,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-07 21:00:21,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-07 21:00:21,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-07 21:00:21,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-07 21:00:21,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-07 21:00:21,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-07 21:00:21,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-07 21:00:21,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-07 21:00:21,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:21,737 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:00:21,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 21:00:22,060 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 21:00:22,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:00:22 BoogieIcfgContainer [2024-11-07 21:00:22,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 21:00:22,087 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 21:00:22,087 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 21:00:22,088 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 21:00:22,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:00:07" (3/4) ... [2024-11-07 21:00:22,092 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 21:00:22,098 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-11-07 21:00:22,098 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-11-07 21:00:22,098 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-07 21:00:22,098 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-11-07 21:00:22,099 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 21:00:22,099 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-11-07 21:00:22,114 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-07 21:00:22,116 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-07 21:00:22,116 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 21:00:22,117 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 21:00:22,145 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-11-07 21:00:22,191 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-11-07 21:00:22,230 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 21:00:22,230 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 21:00:22,230 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 21:00:22,231 INFO L158 Benchmark]: Toolchain (without parser) took 15923.14ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 91.7MB in the beginning and 222.5MB in the end (delta: -130.8MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-07 21:00:22,231 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:00:22,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.52ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 75.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 21:00:22,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.13ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 72.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:00:22,233 INFO L158 Benchmark]: Boogie Preprocessor took 64.39ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 69.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 21:00:22,234 INFO L158 Benchmark]: RCFGBuilder took 671.62ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 75.7MB in the end (delta: -6.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-07 21:00:22,234 INFO L158 Benchmark]: TraceAbstraction took 14670.76ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 75.3MB in the beginning and 233.9MB in the end (delta: -158.6MB). Peak memory consumption was 149.8MB. Max. memory is 16.1GB. [2024-11-07 21:00:22,235 INFO L158 Benchmark]: Witness Printer took 142.90ms. Allocated memory is still 268.4MB. Free memory was 233.9MB in the beginning and 222.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 21:00:22,237 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.52ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 75.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.13ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 72.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.39ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 69.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 671.62ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 75.7MB in the end (delta: -6.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14670.76ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 75.3MB in the beginning and 233.9MB in the end (delta: -158.6MB). Peak memory consumption was 149.8MB. Max. memory is 16.1GB. * Witness Printer took 142.90ms. Allocated memory is still 268.4MB. Free memory was 233.9MB in the beginning and 222.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 193 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 21530 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15296 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 6234 mSDtfsCounter, 1012 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2527 GetRequests, 2369 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=18, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 118 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 4033 NumberOfCodeBlocks, 4033 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3992 ConstructedInterpolants, 0 QuantifiedInterpolants, 6070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10641 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 41 InterpolantComputations, 22 PerfectInterpolantSequences, 1814/1875 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) - ProcedureContractResult [Line: 104]: Procedure Contract for read_history_int8 Derived contract for procedure read_history_int8. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 124]: Procedure Contract for read_history_bool Derived contract for procedure read_history_bool. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 526]: Procedure Contract for assert Derived contract for procedure assert. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 60]: Procedure Contract for add_history_type Derived contract for procedure add_history_type. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 36]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 179]: Procedure Contract for write_history_bool Derived contract for procedure write_history_bool. Ensures: (((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) RESULT: Ultimate proved your program to be correct! [2024-11-07 21:00:22,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE