./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.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.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', '6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3'] 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.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 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 21:00:06,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 21:00:06,689 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:06,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 21:00:06,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 21:00:06,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 21:00:06,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 21:00:06,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 21:00:06,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 21:00:06,728 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 21:00:06,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 21:00:06,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 21:00:06,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 21:00:06,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 21:00:06,730 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 21:00:06,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 21:00:06,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 21:00:06,730 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 21:00:06,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 21:00:06,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 21:00:06,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 21:00:06,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 21:00:06,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 21:00:06,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 21:00:06,731 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 21:00:06,731 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 21:00:06,731 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 21:00:06,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 21:00:06,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 21:00:06,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 21:00:06,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 21:00:06,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 21:00:06,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 21:00:06,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 21:00:06,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:00:06,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 21:00:06,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 21:00:06,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 21:00:06,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 21:00:06,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 21:00:06,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 21:00:06,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 21:00:06,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 21:00:06,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 21:00:06,734 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 -> 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 [2024-11-07 21:00:07,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 21:00:07,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 21:00:07,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 21:00:07,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 21:00:07,017 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 21:00:07,019 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.ufo.UNBOUNDED.pals.c [2024-11-07 21:00:08,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 21:00:08,578 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 21:00:08,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-11-07 21:00:08,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7af310cba/4605b11c5cd246a1ab8cbf040aa95cab/FLAG05d4c77ae [2024-11-07 21:00:08,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7af310cba/4605b11c5cd246a1ab8cbf040aa95cab [2024-11-07 21:00:08,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 21:00:08,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 21:00:08,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 21:00:08,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 21:00:08,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 21:00:08,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:00:08" (1/1) ... [2024-11-07 21:00:08,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d75be74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:08, skipping insertion in model container [2024-11-07 21:00:08,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:00:08" (1/1) ... [2024-11-07 21:00:08,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 21:00:08,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:00:08,872 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 21:00:08,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:00:08,942 INFO L204 MainTranslator]: Completed translation [2024-11-07 21:00:08,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:08 WrapperNode [2024-11-07 21:00:08,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 21:00:08,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 21:00:08,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 21:00:08,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 21:00:08,949 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:08" (1/1) ... [2024-11-07 21:00:08,958 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:08" (1/1) ... [2024-11-07 21:00:08,985 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 433 [2024-11-07 21:00:08,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 21:00:08,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 21:00:08,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 21:00:08,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 21:00:08,994 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:08" (1/1) ... [2024-11-07 21:00:08,994 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:08" (1/1) ... [2024-11-07 21:00:08,998 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:08" (1/1) ... [2024-11-07 21:00:09,021 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:09,022 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:08" (1/1) ... [2024-11-07 21:00:09,022 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:08" (1/1) ... [2024-11-07 21:00:09,042 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:08" (1/1) ... [2024-11-07 21:00:09,051 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:08" (1/1) ... [2024-11-07 21:00:09,053 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:08" (1/1) ... [2024-11-07 21:00:09,058 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:08" (1/1) ... [2024-11-07 21:00:09,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 21:00:09,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 21:00:09,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 21:00:09,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 21:00:09,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:08" (1/1) ... [2024-11-07 21:00:09,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:00:09,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:09,093 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:09,098 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:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 21:00:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-07 21:00:09,120 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-07 21:00:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-07 21:00:09,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-07 21:00:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-07 21:00:09,120 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-07 21:00:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-07 21:00:09,121 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-07 21:00:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-07 21:00:09,121 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-07 21:00:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 21:00:09,121 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 21:00:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 21:00:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 21:00:09,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 21:00:09,249 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 21:00:09,251 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 21:00:09,935 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-07 21:00:09,935 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 21:00:09,952 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 21:00:09,953 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 21:00:09,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:00:09 BoogieIcfgContainer [2024-11-07 21:00:09,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 21:00:09,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 21:00:09,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 21:00:09,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 21:00:09,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:00:08" (1/3) ... [2024-11-07 21:00:09,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33779ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:00:09, skipping insertion in model container [2024-11-07 21:00:09,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:00:08" (2/3) ... [2024-11-07 21:00:09,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33779ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:00:09, skipping insertion in model container [2024-11-07 21:00:09,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:00:09" (3/3) ... [2024-11-07 21:00:09,964 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-11-07 21:00:09,978 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 21:00:09,978 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-07 21:00:10,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 21:00:10,050 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;@40189105, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 21:00:10,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-07 21:00:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 143 states have (on average 1.6013986013986015) internal successors, (229), 155 states have internal predecessors, (229), 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:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 21:00:10,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:10,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:00:10,062 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:10,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash 462902644, now seen corresponding path program 1 times [2024-11-07 21:00:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:10,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739440089] [2024-11-07 21:00:10,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:10,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,413 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:10,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:10,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739440089] [2024-11-07 21:00:10,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739440089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:10,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:00:10,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 21:00:10,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754121384] [2024-11-07 21:00:10,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:10,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:10,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 21:00:10,441 INFO L87 Difference]: Start difference. First operand has 195 states, 143 states have (on average 1.6013986013986015) internal successors, (229), 155 states have internal predecessors, (229), 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:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:10,581 INFO L93 Difference]: Finished difference Result 406 states and 669 transitions. [2024-11-07 21:00:10,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:10,583 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:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:10,592 INFO L225 Difference]: With dead ends: 406 [2024-11-07 21:00:10,592 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 21:00:10,596 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:10,599 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 37 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 874 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:10,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 874 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 21:00:10,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 21:00:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2024-11-07 21:00:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 153 states have (on average 1.5751633986928104) internal successors, (241), 164 states have internal predecessors, (241), 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:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 317 transitions. [2024-11-07 21:00:10,677 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 317 transitions. Word has length 11 [2024-11-07 21:00:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:10,678 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 317 transitions. [2024-11-07 21:00:10,678 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:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 317 transitions. [2024-11-07 21:00:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 21:00:10,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:10,680 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:10,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 21:00:10,682 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:10,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:10,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1750537448, now seen corresponding path program 1 times [2024-11-07 21:00:10,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:10,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812761757] [2024-11-07 21:00:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:10,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 21:00:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:10,855 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:10,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:10,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812761757] [2024-11-07 21:00:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812761757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:10,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:00:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 21:00:10,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623076962] [2024-11-07 21:00:10,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:10,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:10,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:10,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:10,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 21:00:10,863 INFO L87 Difference]: Start difference. First operand 206 states and 317 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:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:10,936 INFO L93 Difference]: Finished difference Result 435 states and 679 transitions. [2024-11-07 21:00:10,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:10,936 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:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:10,940 INFO L225 Difference]: With dead ends: 435 [2024-11-07 21:00:10,940 INFO L226 Difference]: Without dead ends: 241 [2024-11-07 21:00:10,942 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:10,945 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 19 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 874 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:10,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 874 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:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-07 21:00:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2024-11-07 21:00:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 179 states have (on average 1.541899441340782) internal successors, (276), 190 states have internal predecessors, (276), 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:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 362 transitions. [2024-11-07 21:00:10,971 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 362 transitions. Word has length 16 [2024-11-07 21:00:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:10,972 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 362 transitions. [2024-11-07 21:00:10,972 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:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 362 transitions. [2024-11-07 21:00:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 21:00:10,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:10,974 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:10,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 21:00:10,974 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:10,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1874375666, now seen corresponding path program 1 times [2024-11-07 21:00:10,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:10,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326939760] [2024-11-07 21:00:10,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:10,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 21:00:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,214 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:11,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326939760] [2024-11-07 21:00:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326939760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715196592] [2024-11-07 21:00:11,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:11,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:11,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:11,217 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:11,219 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:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 21:00:11,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:11,430 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:11,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:11,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715196592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:11,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:11,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-07 21:00:11,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773594817] [2024-11-07 21:00:11,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:11,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 21:00:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:11,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 21:00:11,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:11,435 INFO L87 Difference]: Start difference. First operand 237 states and 362 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:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:11,483 INFO L93 Difference]: Finished difference Result 241 states and 368 transitions. [2024-11-07 21:00:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:11,485 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:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:11,488 INFO L225 Difference]: With dead ends: 241 [2024-11-07 21:00:11,489 INFO L226 Difference]: Without dead ends: 240 [2024-11-07 21:00:11,489 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:11,490 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 19 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 836 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:11,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 836 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:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-07 21:00:11,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2024-11-07 21:00:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 179 states have (on average 1.5251396648044693) internal successors, (273), 189 states have internal predecessors, (273), 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:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 359 transitions. [2024-11-07 21:00:11,522 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 359 transitions. Word has length 29 [2024-11-07 21:00:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:11,522 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 359 transitions. [2024-11-07 21:00:11,522 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:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 359 transitions. [2024-11-07 21:00:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 21:00:11,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:11,527 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:11,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 21:00:11,727 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:11,728 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:11,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2023897026, now seen corresponding path program 1 times [2024-11-07 21:00:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:11,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120720682] [2024-11-07 21:00:11,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 21:00:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:11,840 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:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:11,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120720682] [2024-11-07 21:00:11,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120720682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:11,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:00:11,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 21:00:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706284438] [2024-11-07 21:00:11,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:11,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:11,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:11,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 21:00:11,844 INFO L87 Difference]: Start difference. First operand 236 states and 359 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:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:11,878 INFO L93 Difference]: Finished difference Result 240 states and 365 transitions. [2024-11-07 21:00:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:11,879 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:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:11,881 INFO L225 Difference]: With dead ends: 240 [2024-11-07 21:00:11,881 INFO L226 Difference]: Without dead ends: 239 [2024-11-07 21:00:11,881 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:11,882 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 18 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 838 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:11,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 838 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:11,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-07 21:00:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 206. [2024-11-07 21:00:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 155 states have (on average 1.5290322580645161) internal successors, (237), 164 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:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2024-11-07 21:00:11,906 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 30 [2024-11-07 21:00:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:11,906 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2024-11-07 21:00:11,906 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:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2024-11-07 21:00:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 21:00:11,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:11,913 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:11,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 21:00:11,913 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:11,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash 205728696, now seen corresponding path program 1 times [2024-11-07 21:00:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:11,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288420597] [2024-11-07 21:00:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 21:00:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 21:00:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 21:00:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 21:00:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 21:00:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 21:00:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,215 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:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288420597] [2024-11-07 21:00:12,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288420597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133775235] [2024-11-07 21:00:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:12,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:12,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:12,222 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:12,226 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:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:12,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:12,435 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:12,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:12,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133775235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:12,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:12,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 21:00:12,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29037838] [2024-11-07 21:00:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:12,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:12,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:12,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:12,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:12,438 INFO L87 Difference]: Start difference. First operand 206 states and 313 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:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:12,506 INFO L93 Difference]: Finished difference Result 359 states and 554 transitions. [2024-11-07 21:00:12,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:12,508 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:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:12,510 INFO L225 Difference]: With dead ends: 359 [2024-11-07 21:00:12,510 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 21:00:12,511 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:12,512 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 10 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 844 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:12,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 844 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:12,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 21:00:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-07 21:00:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 160 states have (on average 1.53125) internal successors, (245), 170 states have internal predecessors, (245), 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:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 323 transitions. [2024-11-07 21:00:12,528 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 323 transitions. Word has length 92 [2024-11-07 21:00:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:12,528 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 323 transitions. [2024-11-07 21:00:12,529 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:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 323 transitions. [2024-11-07 21:00:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 21:00:12,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:12,542 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:12,560 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:12,743 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:12,743 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:12,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash -527112528, now seen corresponding path program 1 times [2024-11-07 21:00:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:12,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916539230] [2024-11-07 21:00:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:12,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 21:00:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 21:00:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 21:00:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 21:00:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:12,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 21:00:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,002 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:13,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916539230] [2024-11-07 21:00:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916539230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:13,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379792906] [2024-11-07 21:00:13,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:13,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:13,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:13,005 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:13,007 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:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:13,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:13,240 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:13,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:13,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379792906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:13,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:13,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 21:00:13,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110500523] [2024-11-07 21:00:13,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:13,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:13,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:13,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:13,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:13,243 INFO L87 Difference]: Start difference. First operand 213 states and 323 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:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:13,305 INFO L93 Difference]: Finished difference Result 373 states and 573 transitions. [2024-11-07 21:00:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:13,305 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:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:13,308 INFO L225 Difference]: With dead ends: 373 [2024-11-07 21:00:13,308 INFO L226 Difference]: Without dead ends: 220 [2024-11-07 21:00:13,308 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:13,309 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 8 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 839 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:13,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 839 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:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-07 21:00:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-11-07 21:00:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 165 states have (on average 1.5333333333333334) internal successors, (253), 176 states have internal predecessors, (253), 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:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 333 transitions. [2024-11-07 21:00:13,325 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 333 transitions. Word has length 94 [2024-11-07 21:00:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:13,326 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 333 transitions. [2024-11-07 21:00:13,326 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:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 333 transitions. [2024-11-07 21:00:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 21:00:13,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:13,328 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:13,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 21:00:13,532 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:13,533 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:13,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash -747242443, now seen corresponding path program 1 times [2024-11-07 21:00:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653411032] [2024-11-07 21:00:13,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:13,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 21:00:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 21:00:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 21:00:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,785 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:13,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:13,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653411032] [2024-11-07 21:00:13,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653411032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:13,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717448525] [2024-11-07 21:00:13,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:13,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:13,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:13,789 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:13,791 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:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:13,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:13,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:13,979 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:13,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:13,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717448525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:13,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:13,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 21:00:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223916122] [2024-11-07 21:00:13,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:13,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:13,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:13,981 INFO L87 Difference]: Start difference. First operand 220 states and 333 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:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:14,096 INFO L93 Difference]: Finished difference Result 398 states and 623 transitions. [2024-11-07 21:00:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:14,097 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:14,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:14,099 INFO L225 Difference]: With dead ends: 398 [2024-11-07 21:00:14,099 INFO L226 Difference]: Without dead ends: 238 [2024-11-07 21:00:14,100 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:14,102 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 39 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 800 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:14,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 800 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:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-07 21:00:14,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-07 21:00:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.5480225988700564) internal successors, (274), 188 states have internal predecessors, (274), 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:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 356 transitions. [2024-11-07 21:00:14,124 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 356 transitions. Word has length 95 [2024-11-07 21:00:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:14,124 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 356 transitions. [2024-11-07 21:00:14,124 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:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 356 transitions. [2024-11-07 21:00:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 21:00:14,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:14,127 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:14,144 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:14,330 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:14,331 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:14,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2094961184, now seen corresponding path program 1 times [2024-11-07 21:00:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:14,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030866967] [2024-11-07 21:00:14,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:14,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 21:00:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 21:00:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,548 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:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030866967] [2024-11-07 21:00:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030866967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781284426] [2024-11-07 21:00:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:14,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:14,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:14,552 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:14,553 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:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:14,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:14,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:14,748 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:14,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:14,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781284426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:14,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:14,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 21:00:14,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096646572] [2024-11-07 21:00:14,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:14,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:14,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:14,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:14,751 INFO L87 Difference]: Start difference. First operand 234 states and 356 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:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:14,835 INFO L93 Difference]: Finished difference Result 473 states and 735 transitions. [2024-11-07 21:00:14,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:14,836 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:14,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:14,838 INFO L225 Difference]: With dead ends: 473 [2024-11-07 21:00:14,838 INFO L226 Difference]: Without dead ends: 258 [2024-11-07 21:00:14,839 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:14,841 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 21 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 820 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:14,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 820 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:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-07 21:00:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-07 21:00:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 197 states have (on average 1.5634517766497462) internal successors, (308), 208 states have internal predecessors, (308), 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:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2024-11-07 21:00:14,859 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 98 [2024-11-07 21:00:14,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:14,860 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2024-11-07 21:00:14,860 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:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2024-11-07 21:00:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 21:00:14,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:14,864 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:14,885 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:15,065 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:15,065 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:15,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1724811394, now seen corresponding path program 1 times [2024-11-07 21:00:15,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:15,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150334153] [2024-11-07 21:00:15,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:15,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 21:00:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,250 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:15,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:15,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150334153] [2024-11-07 21:00:15,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150334153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:15,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042914591] [2024-11-07 21:00:15,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:15,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:15,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:15,252 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:15,255 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:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:15,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:15,473 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:15,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:15,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042914591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:15,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:15,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 21:00:15,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249528042] [2024-11-07 21:00:15,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:15,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:15,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:15,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:15,479 INFO L87 Difference]: Start difference. First operand 258 states and 394 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:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:15,555 INFO L93 Difference]: Finished difference Result 517 states and 800 transitions. [2024-11-07 21:00:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:15,556 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:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:15,558 INFO L225 Difference]: With dead ends: 517 [2024-11-07 21:00:15,558 INFO L226 Difference]: Without dead ends: 278 [2024-11-07 21:00:15,559 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:15,560 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 19 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 807 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:15,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 807 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 21:00:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-07 21:00:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-07 21:00:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 213 states have (on average 1.568075117370892) internal successors, (334), 224 states have internal predecessors, (334), 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:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 424 transitions. [2024-11-07 21:00:15,581 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 424 transitions. Word has length 100 [2024-11-07 21:00:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:15,582 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 424 transitions. [2024-11-07 21:00:15,582 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:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 424 transitions. [2024-11-07 21:00:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 21:00:15,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:15,586 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:15,606 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:15,787 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:15,787 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:15,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1043071740, now seen corresponding path program 1 times [2024-11-07 21:00:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:15,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078935423] [2024-11-07 21:00:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:15,988 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:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078935423] [2024-11-07 21:00:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078935423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650980969] [2024-11-07 21:00:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:15,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:15,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:15,991 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:15,993 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:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:16,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:16,199 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:16,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:16,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650980969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:16,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:16,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775341244] [2024-11-07 21:00:16,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:16,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:16,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:16,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:16,204 INFO L87 Difference]: Start difference. First operand 278 states and 424 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:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:16,250 INFO L93 Difference]: Finished difference Result 286 states and 439 transitions. [2024-11-07 21:00:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:16,250 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:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:16,253 INFO L225 Difference]: With dead ends: 286 [2024-11-07 21:00:16,253 INFO L226 Difference]: Without dead ends: 285 [2024-11-07 21:00:16,253 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:16,256 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 12 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 827 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:16,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 827 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:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-07 21:00:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 277. [2024-11-07 21:00:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 213 states have (on average 1.5633802816901408) internal successors, (333), 223 states have internal predecessors, (333), 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:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 423 transitions. [2024-11-07 21:00:16,287 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 423 transitions. Word has length 101 [2024-11-07 21:00:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:16,287 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 423 transitions. [2024-11-07 21:00:16,287 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:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 423 transitions. [2024-11-07 21:00:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 21:00:16,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:16,290 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:16,307 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:16,494 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:16,495 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:16,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:16,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2024514750, now seen corresponding path program 1 times [2024-11-07 21:00:16,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:16,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134533485] [2024-11-07 21:00:16,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:16,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,680 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:16,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:16,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134533485] [2024-11-07 21:00:16,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134533485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:16,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339953296] [2024-11-07 21:00:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:16,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:16,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:16,684 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:16,685 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:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:16,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:16,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:16,879 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:16,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:16,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339953296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:16,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:16,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982877261] [2024-11-07 21:00:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:16,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:16,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:16,882 INFO L87 Difference]: Start difference. First operand 277 states and 423 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:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:16,920 INFO L93 Difference]: Finished difference Result 474 states and 728 transitions. [2024-11-07 21:00:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:16,920 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:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:16,923 INFO L225 Difference]: With dead ends: 474 [2024-11-07 21:00:16,923 INFO L226 Difference]: Without dead ends: 287 [2024-11-07 21:00:16,924 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:16,924 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 11 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 858 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:16,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 858 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:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-07 21:00:16,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-07 21:00:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 222 states have (on average 1.5585585585585586) internal successors, (346), 231 states have internal predecessors, (346), 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,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 440 transitions. [2024-11-07 21:00:16,938 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 440 transitions. Word has length 102 [2024-11-07 21:00:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:16,938 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 440 transitions. [2024-11-07 21:00:16,939 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:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 440 transitions. [2024-11-07 21:00:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 21:00:16,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:16,941 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:16,959 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:17,141 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:17,142 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:17,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash -377532014, now seen corresponding path program 1 times [2024-11-07 21:00:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:17,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183937643] [2024-11-07 21:00:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:17,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,333 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:17,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:17,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183937643] [2024-11-07 21:00:17,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183937643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:17,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235113976] [2024-11-07 21:00:17,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:17,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:17,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:17,336 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:17,338 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:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:17,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:17,538 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:17,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235113976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:17,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:17,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:17,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737755103] [2024-11-07 21:00:17,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:17,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:17,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:17,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:17,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:17,540 INFO L87 Difference]: Start difference. First operand 287 states and 440 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:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:17,588 INFO L93 Difference]: Finished difference Result 298 states and 459 transitions. [2024-11-07 21:00:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:17,589 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:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:17,592 INFO L225 Difference]: With dead ends: 298 [2024-11-07 21:00:17,592 INFO L226 Difference]: Without dead ends: 297 [2024-11-07 21:00:17,592 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:17,593 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 10 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 869 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,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 869 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,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-07 21:00:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 288. [2024-11-07 21:00:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 223 states have (on average 1.5560538116591929) internal successors, (347), 232 states have internal predecessors, (347), 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:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 441 transitions. [2024-11-07 21:00:17,609 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 441 transitions. Word has length 109 [2024-11-07 21:00:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:17,610 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 441 transitions. [2024-11-07 21:00:17,610 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:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 441 transitions. [2024-11-07 21:00:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 21:00:17,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:17,613 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:17,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-07 21:00:17,814 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:17,814 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:17,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1181409788, now seen corresponding path program 1 times [2024-11-07 21:00:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387680874] [2024-11-07 21:00:17,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:17,982 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:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387680874] [2024-11-07 21:00:17,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387680874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:17,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794723853] [2024-11-07 21:00:17,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:17,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:17,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:17,985 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:17,987 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:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:18,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:18,186 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:18,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:18,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794723853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:18,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:18,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:18,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087615221] [2024-11-07 21:00:18,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:18,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:18,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:18,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:18,188 INFO L87 Difference]: Start difference. First operand 288 states and 441 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:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:18,224 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2024-11-07 21:00:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:18,225 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:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:18,227 INFO L225 Difference]: With dead ends: 290 [2024-11-07 21:00:18,227 INFO L226 Difference]: Without dead ends: 289 [2024-11-07 21:00:18,228 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:18,228 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 9 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:18,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 856 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-07 21:00:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-11-07 21:00:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 224 states have (on average 1.5535714285714286) internal successors, (348), 233 states have internal predecessors, (348), 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:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 442 transitions. [2024-11-07 21:00:18,240 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 442 transitions. Word has length 110 [2024-11-07 21:00:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:18,241 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 442 transitions. [2024-11-07 21:00:18,241 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:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 442 transitions. [2024-11-07 21:00:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 21:00:18,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:18,243 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:18,260 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:18,444 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:18,445 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:18,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:18,446 INFO L85 PathProgramCache]: Analyzing trace with hash -966294506, now seen corresponding path program 1 times [2024-11-07 21:00:18,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:18,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359412030] [2024-11-07 21:00:18,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:18,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 21:00:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,634 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:18,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:18,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359412030] [2024-11-07 21:00:18,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359412030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:18,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728278599] [2024-11-07 21:00:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:18,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:18,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:18,637 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:18,640 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:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:18,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 21:00:18,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:18,850 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:18,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728278599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:18,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:18,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-07 21:00:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740086593] [2024-11-07 21:00:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:18,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 21:00:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:18,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 21:00:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:18,853 INFO L87 Difference]: Start difference. First operand 289 states and 442 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:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:18,900 INFO L93 Difference]: Finished difference Result 294 states and 452 transitions. [2024-11-07 21:00:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:18,901 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:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:18,903 INFO L225 Difference]: With dead ends: 294 [2024-11-07 21:00:18,903 INFO L226 Difference]: Without dead ends: 293 [2024-11-07 21:00:18,904 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:18,905 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 12 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1087 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:18,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1087 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:18,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-07 21:00:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 288. [2024-11-07 21:00:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.5491071428571428) internal successors, (347), 232 states have internal predecessors, (347), 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:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 441 transitions. [2024-11-07 21:00:18,920 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 441 transitions. Word has length 111 [2024-11-07 21:00:18,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:18,921 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 441 transitions. [2024-11-07 21:00:18,921 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:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 441 transitions. [2024-11-07 21:00:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 21:00:18,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:18,924 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:18,941 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:19,124 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:19,125 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:19,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:19,125 INFO L85 PathProgramCache]: Analyzing trace with hash 109641720, now seen corresponding path program 1 times [2024-11-07 21:00:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:19,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423802128] [2024-11-07 21:00:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 21:00:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,295 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:19,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:19,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423802128] [2024-11-07 21:00:19,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423802128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:19,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611028237] [2024-11-07 21:00:19,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:19,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:19,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:19,298 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:19,300 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:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 21:00:19,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:19,520 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:19,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:19,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611028237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:19,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:19,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-07 21:00:19,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771483340] [2024-11-07 21:00:19,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:19,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 21:00:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 21:00:19,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 21:00:19,523 INFO L87 Difference]: Start difference. First operand 288 states and 441 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:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:19,584 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2024-11-07 21:00:19,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 21:00:19,585 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:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:19,589 INFO L225 Difference]: With dead ends: 493 [2024-11-07 21:00:19,589 INFO L226 Difference]: Without dead ends: 295 [2024-11-07 21:00:19,591 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:19,592 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 29 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:19,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1119 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-07 21:00:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 291. [2024-11-07 21:00:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.5550660792951543) internal successors, (353), 234 states have internal predecessors, (353), 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,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 449 transitions. [2024-11-07 21:00:19,605 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 449 transitions. Word has length 112 [2024-11-07 21:00:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:19,606 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 449 transitions. [2024-11-07 21:00:19,606 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:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 449 transitions. [2024-11-07 21:00:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 21:00:19,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:19,608 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:19,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-07 21:00:19,808 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:19,809 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:19,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash 501283168, now seen corresponding path program 1 times [2024-11-07 21:00:19,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:19,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9675091] [2024-11-07 21:00:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:19,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 21:00:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:19,980 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,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9675091] [2024-11-07 21:00:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9675091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297021259] [2024-11-07 21:00:19,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:19,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:19,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:19,982 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:19,984 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:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:20,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:20,198 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,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:20,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297021259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:20,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:20,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:20,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189442753] [2024-11-07 21:00:20,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:20,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:20,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:20,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:20,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:20,201 INFO L87 Difference]: Start difference. First operand 291 states and 449 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:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:20,244 INFO L93 Difference]: Finished difference Result 300 states and 464 transitions. [2024-11-07 21:00:20,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:20,244 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:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:20,247 INFO L225 Difference]: With dead ends: 300 [2024-11-07 21:00:20,249 INFO L226 Difference]: Without dead ends: 299 [2024-11-07 21:00:20,250 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:20,250 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 8 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:20,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 835 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-07 21:00:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 292. [2024-11-07 21:00:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.5526315789473684) internal successors, (354), 235 states have internal predecessors, (354), 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,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2024-11-07 21:00:20,263 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 117 [2024-11-07 21:00:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:20,264 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2024-11-07 21:00:20,264 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:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2024-11-07 21:00:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 21:00:20,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:20,266 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:20,283 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:20,466 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:20,467 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:20,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:20,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1640090630, now seen corresponding path program 1 times [2024-11-07 21:00:20,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:20,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424401191] [2024-11-07 21:00:20,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:20,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 21:00:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,621 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,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:20,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424401191] [2024-11-07 21:00:20,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424401191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873361304] [2024-11-07 21:00:20,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:20,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:20,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:20,624 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:20,627 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:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:20,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:00:20,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:20,828 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,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:20,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873361304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:20,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:20,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-07 21:00:20,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684779682] [2024-11-07 21:00:20,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:20,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:00:20,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:20,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:00:20,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 21:00:20,831 INFO L87 Difference]: Start difference. First operand 292 states and 450 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:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:20,864 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2024-11-07 21:00:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:00:20,865 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:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:20,867 INFO L225 Difference]: With dead ends: 295 [2024-11-07 21:00:20,868 INFO L226 Difference]: Without dead ends: 294 [2024-11-07 21:00:20,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 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:20,868 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 7 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:20,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 826 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-07 21:00:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2024-11-07 21:00:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 229 states have (on average 1.5502183406113537) internal successors, (355), 236 states have internal predecessors, (355), 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,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 451 transitions. [2024-11-07 21:00:20,881 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 451 transitions. Word has length 118 [2024-11-07 21:00:20,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:20,882 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 451 transitions. [2024-11-07 21:00:20,882 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:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 451 transitions. [2024-11-07 21:00:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 21:00:20,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:20,884 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:20,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-07 21:00:21,085 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:21,087 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:21,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:21,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1673553892, now seen corresponding path program 1 times [2024-11-07 21:00:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:21,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796934854] [2024-11-07 21:00:21,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:21,176 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 3 [2024-11-07 21:00:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 21:00:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 21:00:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,249 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,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796934854] [2024-11-07 21:00:21,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796934854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331606732] [2024-11-07 21:00:21,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:21,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:21,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:21,252 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:21,257 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:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 21:00:21,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:21,468 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,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:21,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331606732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:21,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:21,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-07 21:00:21,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098202435] [2024-11-07 21:00:21,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:21,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 21:00:21,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 21:00:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:21,470 INFO L87 Difference]: Start difference. First operand 293 states and 451 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:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:21,517 INFO L93 Difference]: Finished difference Result 301 states and 465 transitions. [2024-11-07 21:00:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:21,518 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:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:21,520 INFO L225 Difference]: With dead ends: 301 [2024-11-07 21:00:21,520 INFO L226 Difference]: Without dead ends: 300 [2024-11-07 21:00:21,521 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:21,523 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 10 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1088 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:21,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1088 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:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-07 21:00:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2024-11-07 21:00:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 230 states have (on average 1.5478260869565217) internal successors, (356), 237 states have internal predecessors, (356), 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:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 452 transitions. [2024-11-07 21:00:21,537 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 452 transitions. Word has length 119 [2024-11-07 21:00:21,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:21,538 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 452 transitions. [2024-11-07 21:00:21,538 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:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 452 transitions. [2024-11-07 21:00:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 21:00:21,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:21,541 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:21,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-07 21:00:21,741 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:21,742 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:21,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:21,742 INFO L85 PathProgramCache]: Analyzing trace with hash -774880796, now seen corresponding path program 1 times [2024-11-07 21:00:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276582777] [2024-11-07 21:00:21,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 21:00:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:21,892 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,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:21,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276582777] [2024-11-07 21:00:21,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276582777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701936927] [2024-11-07 21:00:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:21,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:21,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:21,897 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:21,898 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:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 21:00:22,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:22,106 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:22,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:22,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701936927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:22,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:22,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-07 21:00:22,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892121566] [2024-11-07 21:00:22,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:22,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 21:00:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:22,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 21:00:22,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 21:00:22,108 INFO L87 Difference]: Start difference. First operand 294 states and 452 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:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:22,155 INFO L93 Difference]: Finished difference Result 302 states and 466 transitions. [2024-11-07 21:00:22,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:00:22,156 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:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:22,159 INFO L225 Difference]: With dead ends: 302 [2024-11-07 21:00:22,159 INFO L226 Difference]: Without dead ends: 301 [2024-11-07 21:00:22,160 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:22,160 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 12 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1103 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:22,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1103 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:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-07 21:00:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 292. [2024-11-07 21:00:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 235 states have internal predecessors, (354), 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:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2024-11-07 21:00:22,175 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 119 [2024-11-07 21:00:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:22,175 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2024-11-07 21:00:22,176 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:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2024-11-07 21:00:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 21:00:22,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:22,178 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:22,195 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:22,378 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:22,379 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:22,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash 340563446, now seen corresponding path program 1 times [2024-11-07 21:00:22,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:22,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270455922] [2024-11-07 21:00:22,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:22,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 21:00:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 21:00:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,534 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:22,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:22,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270455922] [2024-11-07 21:00:22,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270455922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:22,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370436604] [2024-11-07 21:00:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:22,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:22,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:22,537 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:22,539 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:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:22,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 21:00:22,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:22,781 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:22,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:22,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370436604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:22,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:22,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-07 21:00:22,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522300618] [2024-11-07 21:00:22,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:22,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 21:00:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:22,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 21:00:22,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 21:00:22,783 INFO L87 Difference]: Start difference. First operand 292 states and 450 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:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:22,832 INFO L93 Difference]: Finished difference Result 297 states and 456 transitions. [2024-11-07 21:00:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 21:00:22,832 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:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:22,835 INFO L225 Difference]: With dead ends: 297 [2024-11-07 21:00:22,835 INFO L226 Difference]: Without dead ends: 296 [2024-11-07 21:00:22,835 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:22,838 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 19 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:22,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1125 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-07 21:00:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-11-07 21:00:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 235 states have internal predecessors, (354), 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:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2024-11-07 21:00:22,854 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 120 [2024-11-07 21:00:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:22,854 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2024-11-07 21:00:22,855 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:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2024-11-07 21:00:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 21:00:22,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:22,857 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:22,875 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:23,061 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:23,062 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:23,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:23,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1748499446, now seen corresponding path program 1 times [2024-11-07 21:00:23,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:23,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599003127] [2024-11-07 21:00:23,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:23,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 21:00:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 21:00:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,199 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:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599003127] [2024-11-07 21:00:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599003127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506937118] [2024-11-07 21:00:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:23,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:23,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:23,202 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:23,209 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:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 21:00:23,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:23,445 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:23,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:23,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506937118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:23,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:23,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-07 21:00:23,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817510728] [2024-11-07 21:00:23,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:23,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 21:00:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:23,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 21:00:23,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 21:00:23,447 INFO L87 Difference]: Start difference. First operand 292 states and 450 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:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:23,516 INFO L93 Difference]: Finished difference Result 509 states and 785 transitions. [2024-11-07 21:00:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 21:00:23,517 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:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:23,520 INFO L225 Difference]: With dead ends: 509 [2024-11-07 21:00:23,520 INFO L226 Difference]: Without dead ends: 307 [2024-11-07 21:00:23,521 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:23,522 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 16 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1438 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.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:23,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1438 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-07 21:00:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294. [2024-11-07 21:00:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.5411255411255411) internal successors, (356), 237 states have internal predecessors, (356), 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:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 452 transitions. [2024-11-07 21:00:23,535 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 452 transitions. Word has length 120 [2024-11-07 21:00:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:23,535 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 452 transitions. [2024-11-07 21:00:23,535 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:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 452 transitions. [2024-11-07 21:00:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 21:00:23,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:00:23,537 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:23,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-07 21:00:23,741 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:23,742 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:23,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:00:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1808412942, now seen corresponding path program 1 times [2024-11-07 21:00:23,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:00:23,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835450626] [2024-11-07 21:00:23,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:23,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:00:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:00:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 21:00:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 21:00:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 21:00:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 21:00:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 21:00:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 21:00:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 21:00:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 21:00:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 21:00:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 21:00:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 21:00:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 21:00:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:23,880 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:23,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:00:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835450626] [2024-11-07 21:00:23,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835450626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:00:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160279538] [2024-11-07 21:00:23,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:00:23,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:00:23,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:00:23,903 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:23,905 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:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:00:24,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 21:00:24,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:00:24,174 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:24,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:00:24,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160279538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:00:24,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:00:24,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-11-07 21:00:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565598592] [2024-11-07 21:00:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:00:24,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 21:00:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:00:24,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 21:00:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-07 21:00:24,176 INFO L87 Difference]: Start difference. First operand 294 states and 452 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:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:00:24,239 INFO L93 Difference]: Finished difference Result 308 states and 477 transitions. [2024-11-07 21:00:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 21:00:24,242 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:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:00:24,242 INFO L225 Difference]: With dead ends: 308 [2024-11-07 21:00:24,242 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 21:00:24,243 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:24,245 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 37 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1614 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.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:00:24,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1614 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:00:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 21:00:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 21:00:24,246 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:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 21:00:24,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2024-11-07 21:00:24,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:00:24,247 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 21:00:24,247 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:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 21:00:24,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 21:00:24,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-07 21:00:24,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-07 21:00:24,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-07 21:00:24,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-07 21:00:24,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-07 21:00:24,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-07 21:00:24,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-07 21:00:24,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-07 21:00:24,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-07 21:00:24,452 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:24,454 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:24,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 21:00:24,771 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 21:00:24,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:00:24 BoogieIcfgContainer [2024-11-07 21:00:24,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 21:00:24,801 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 21:00:24,801 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 21:00:24,802 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 21:00:24,802 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:09" (3/4) ... [2024-11-07 21:00:24,804 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 21:00:24,809 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-11-07 21:00:24,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-11-07 21:00:24,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-07 21:00:24,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-11-07 21:00:24,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 21:00:24,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-11-07 21:00:24,825 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-07 21:00:24,826 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-07 21:00:24,826 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 21:00:24,827 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 21:00:24,853 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:24,901 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:24,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 21:00:24,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 21:00:24,940 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 21:00:24,940 INFO L158 Benchmark]: Toolchain (without parser) took 16328.26ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 77.0MB in the beginning and 74.2MB in the end (delta: 2.8MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2024-11-07 21:00:24,941 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:00:24,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.30ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 60.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 21:00:24,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.92ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 57.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:00:24,942 INFO L158 Benchmark]: Boogie Preprocessor took 74.56ms. Allocated memory is still 100.7MB. Free memory was 57.5MB in the beginning and 54.0MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 21:00:24,942 INFO L158 Benchmark]: RCFGBuilder took 891.35ms. Allocated memory is still 100.7MB. Free memory was 54.0MB in the beginning and 60.6MB in the end (delta: -6.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-07 21:00:24,942 INFO L158 Benchmark]: TraceAbstraction took 14844.52ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 60.0MB in the beginning and 84.6MB in the end (delta: -24.5MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-11-07 21:00:24,943 INFO L158 Benchmark]: Witness Printer took 138.32ms. Allocated memory is still 184.5MB. Free memory was 84.6MB in the beginning and 74.2MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 21:00:24,944 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 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.30ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 60.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.92ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 57.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.56ms. Allocated memory is still 100.7MB. Free memory was 57.5MB in the beginning and 54.0MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 891.35ms. Allocated memory is still 100.7MB. Free memory was 54.0MB in the beginning and 60.6MB in the end (delta: -6.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14844.52ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 60.0MB in the beginning and 84.6MB in the end (delta: -24.5MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. * Witness Printer took 138.32ms. Allocated memory is still 184.5MB. Free memory was 84.6MB in the beginning and 74.2MB in the end (delta: 10.3MB). 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, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 417 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382 mSDsluCounter, 21177 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14910 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 941 IncrementalHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 6267 mSDtfsCounter, 941 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=294occurred 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.6s 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: 74]: Loop Invariant Derived loop invariant: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: 1 - 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: 534]: 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:24,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE