./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.i --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/uthash-2.0.2/uthash_JEN_nondet_test4-3.i', '-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', '87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435'] 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/uthash-2.0.2/uthash_JEN_nondet_test4-3.i -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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 23:08:51,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 23:08:51,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 23:08:51,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 23:08:51,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 23:08:51,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 23:08:51,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 23:08:51,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 23:08:51,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 23:08:51,390 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 23:08:51,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 23:08:51,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 23:08:51,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 23:08:51,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 23:08:51,391 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 23:08:51,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 23:08:51,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 23:08:51,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 23:08:51,392 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 23:08:51,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 23:08:51,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 23:08:51,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 23:08:51,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 23:08:51,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 23:08:51,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 23:08:51,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 23:08:51,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 23:08:51,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 23:08:51,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 23:08:51,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 23:08:51,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 23:08:51,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 23:08:51,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 23:08:51,394 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-07 23:08:51,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 23:08:51,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 23:08:51,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 23:08:51,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 23:08:51,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 23:08:51,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.i [2024-11-07 23:08:52,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 23:08:53,125 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 23:08:53,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.i [2024-11-07 23:08:53,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8bc44404/58a2b2e181a8452f9ecbb302e8f7e447/FLAGf2d865c6d [2024-11-07 23:08:53,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8bc44404/58a2b2e181a8452f9ecbb302e8f7e447 [2024-11-07 23:08:53,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 23:08:53,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 23:08:53,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 23:08:53,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 23:08:53,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 23:08:53,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:53,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73dbb678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53, skipping insertion in model container [2024-11-07 23:08:53,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:53,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 23:08:53,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:08:53,868 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 23:08:53,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:08:53,983 INFO L204 MainTranslator]: Completed translation [2024-11-07 23:08:53,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53 WrapperNode [2024-11-07 23:08:53,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 23:08:53,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 23:08:53,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 23:08:53,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 23:08:53,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,093 INFO L138 Inliner]: procedures = 176, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1870 [2024-11-07 23:08:54,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 23:08:54,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 23:08:54,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 23:08:54,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 23:08:54,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,252 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-07 23:08:54,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 23:08:54,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 23:08:54,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 23:08:54,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 23:08:54,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (1/1) ... [2024-11-07 23:08:54,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 23:08:54,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:08:54,367 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 23:08:54,370 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 23:08:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 23:08:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 23:08:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 23:08:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 23:08:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 23:08:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 23:08:54,388 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 23:08:54,389 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 23:08:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 23:08:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 23:08:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 23:08:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 23:08:54,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 23:08:54,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 23:08:54,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 23:08:54,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 23:08:54,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 23:08:54,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 23:08:54,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 23:08:54,576 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 23:08:54,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 23:08:55,744 INFO L? ?]: Removed 424 outVars from TransFormulas that were not future-live. [2024-11-07 23:08:55,744 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 23:08:55,767 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 23:08:55,770 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-07 23:08:55,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:08:55 BoogieIcfgContainer [2024-11-07 23:08:55,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 23:08:55,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 23:08:55,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 23:08:55,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 23:08:55,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:08:53" (1/3) ... [2024-11-07 23:08:55,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a53b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:08:55, skipping insertion in model container [2024-11-07 23:08:55,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:53" (2/3) ... [2024-11-07 23:08:55,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a53b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:08:55, skipping insertion in model container [2024-11-07 23:08:55,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:08:55" (3/3) ... [2024-11-07 23:08:55,781 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test4-3.i [2024-11-07 23:08:55,793 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 23:08:55,793 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 23:08:55,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 23:08:55,864 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;@3ad603a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 23:08:55,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 23:08:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 474 states, 462 states have (on average 1.619047619047619) internal successors, (748), 466 states have internal predecessors, (748), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:08:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 23:08:55,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:08:55,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:08:55,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:08:55,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:08:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash -699476840, now seen corresponding path program 1 times [2024-11-07 23:08:55,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:08:55,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625579819] [2024-11-07 23:08:55,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:08:55,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:08:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:55,991 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 23:08:55,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:08:55,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625579819] [2024-11-07 23:08:55,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625579819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:08:55,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:08:55,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 23:08:55,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188749162] [2024-11-07 23:08:55,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:08:55,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 23:08:55,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:08:56,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 23:08:56,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 23:08:56,016 INFO L87 Difference]: Start difference. First operand has 474 states, 462 states have (on average 1.619047619047619) internal successors, (748), 466 states have internal predecessors, (748), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 23:08:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:08:56,073 INFO L93 Difference]: Finished difference Result 943 states and 1515 transitions. [2024-11-07 23:08:56,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 23:08:56,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-07 23:08:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:08:56,091 INFO L225 Difference]: With dead ends: 943 [2024-11-07 23:08:56,092 INFO L226 Difference]: Without dead ends: 398 [2024-11-07 23:08:56,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 23:08:56,100 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 23:08:56,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 23:08:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-07 23:08:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2024-11-07 23:08:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 388 states have (on average 1.443298969072165) internal successors, (560), 390 states have internal predecessors, (560), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:08:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 572 transitions. [2024-11-07 23:08:56,162 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 572 transitions. Word has length 7 [2024-11-07 23:08:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:08:56,166 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 572 transitions. [2024-11-07 23:08:56,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 23:08:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 572 transitions. [2024-11-07 23:08:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 23:08:56,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:08:56,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:08:56,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 23:08:56,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:08:56,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:08:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash -208885906, now seen corresponding path program 1 times [2024-11-07 23:08:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:08:56,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826881873] [2024-11-07 23:08:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:08:56,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:08:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 23:08:56,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472196879] [2024-11-07 23:08:56,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:08:56,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:08:56,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:08:56,203 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 23:08:56,207 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 23:08:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:56,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 23:08:56,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:08:56,405 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 23:08:56,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 23:08:56,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:08:56,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826881873] [2024-11-07 23:08:56,406 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 23:08:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472196879] [2024-11-07 23:08:56,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472196879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:08:56,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:08:56,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 23:08:56,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657336677] [2024-11-07 23:08:56,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:08:56,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 23:08:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:08:56,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 23:08:56,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 23:08:56,408 INFO L87 Difference]: Start difference. First operand 398 states and 572 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 23:08:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:08:56,463 INFO L93 Difference]: Finished difference Result 785 states and 1133 transitions. [2024-11-07 23:08:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 23:08:56,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-07 23:08:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:08:56,467 INFO L225 Difference]: With dead ends: 785 [2024-11-07 23:08:56,467 INFO L226 Difference]: Without dead ends: 784 [2024-11-07 23:08:56,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 23:08:56,468 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 543 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 23:08:56,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1182 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 23:08:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-07 23:08:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 403. [2024-11-07 23:08:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 393 states have (on average 1.4376590330788803) internal successors, (565), 395 states have internal predecessors, (565), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:08:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 577 transitions. [2024-11-07 23:08:56,489 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 577 transitions. Word has length 8 [2024-11-07 23:08:56,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:08:56,490 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 577 transitions. [2024-11-07 23:08:56,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 23:08:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 577 transitions. [2024-11-07 23:08:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 23:08:56,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:08:56,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:08:56,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 23:08:56,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:08:56,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:08:56,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:08:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash 839446148, now seen corresponding path program 1 times [2024-11-07 23:08:56,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:08:56,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417826340] [2024-11-07 23:08:56,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:08:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:08:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:57,298 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 23:08:57,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:08:57,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417826340] [2024-11-07 23:08:57,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417826340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:08:57,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:08:57,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:08:57,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680000067] [2024-11-07 23:08:57,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:08:57,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 23:08:57,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:08:57,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 23:08:57,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 23:08:57,301 INFO L87 Difference]: Start difference. First operand 403 states and 577 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 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 23:08:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:08:57,372 INFO L93 Difference]: Finished difference Result 801 states and 1149 transitions. [2024-11-07 23:08:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 23:08:57,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-11-07 23:08:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:08:57,375 INFO L225 Difference]: With dead ends: 801 [2024-11-07 23:08:57,375 INFO L226 Difference]: Without dead ends: 406 [2024-11-07 23:08:57,376 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 23:08:57,377 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 105 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 23:08:57,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1539 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 23:08:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-07 23:08:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 403. [2024-11-07 23:08:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 393 states have (on average 1.4198473282442747) internal successors, (558), 395 states have internal predecessors, (558), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:08:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 570 transitions. [2024-11-07 23:08:57,387 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 570 transitions. Word has length 152 [2024-11-07 23:08:57,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:08:57,390 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 570 transitions. [2024-11-07 23:08:57,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 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 23:08:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 570 transitions. [2024-11-07 23:08:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 23:08:57,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:08:57,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:08:57,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 23:08:57,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:08:57,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:08:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash -609280240, now seen corresponding path program 1 times [2024-11-07 23:08:57,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:08:57,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098758295] [2024-11-07 23:08:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:08:57,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:08:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:57,607 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 23:08:57,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:08:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098758295] [2024-11-07 23:08:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098758295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:08:57,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:08:57,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 23:08:57,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359880687] [2024-11-07 23:08:57,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:08:57,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 23:08:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:08:57,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 23:08:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 23:08:57,611 INFO L87 Difference]: Start difference. First operand 403 states and 570 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 23:08:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:08:57,643 INFO L93 Difference]: Finished difference Result 925 states and 1319 transitions. [2024-11-07 23:08:57,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 23:08:57,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-11-07 23:08:57,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:08:57,646 INFO L225 Difference]: With dead ends: 925 [2024-11-07 23:08:57,646 INFO L226 Difference]: Without dead ends: 530 [2024-11-07 23:08:57,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 23:08:57,648 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 134 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 23:08:57,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1120 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 23:08:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-07 23:08:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2024-11-07 23:08:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 520 states have (on average 1.4307692307692308) internal successors, (744), 522 states have internal predecessors, (744), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:08:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 756 transitions. [2024-11-07 23:08:57,661 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 756 transitions. Word has length 152 [2024-11-07 23:08:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:08:57,663 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 756 transitions. [2024-11-07 23:08:57,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 23:08:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 756 transitions. [2024-11-07 23:08:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 23:08:57,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:08:57,665 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:08:57,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 23:08:57,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:08:57,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:08:57,665 INFO L85 PathProgramCache]: Analyzing trace with hash 601390206, now seen corresponding path program 1 times [2024-11-07 23:08:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:08:57,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636829730] [2024-11-07 23:08:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:08:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:08:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:58,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:08:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:08:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 23:08:58,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:08:58,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636829730] [2024-11-07 23:08:58,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636829730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:08:58,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:08:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 23:08:58,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456286038] [2024-11-07 23:08:58,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:08:58,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 23:08:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:08:58,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 23:08:58,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 23:08:58,053 INFO L87 Difference]: Start difference. First operand 530 states and 756 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:08:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:08:58,369 INFO L93 Difference]: Finished difference Result 931 states and 1330 transitions. [2024-11-07 23:08:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 23:08:58,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-11-07 23:08:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:08:58,373 INFO L225 Difference]: With dead ends: 931 [2024-11-07 23:08:58,373 INFO L226 Difference]: Without dead ends: 536 [2024-11-07 23:08:58,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 23:08:58,376 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 109 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 23:08:58,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1961 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 23:08:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-07 23:08:58,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 530. [2024-11-07 23:08:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 520 states have (on average 1.4173076923076924) internal successors, (737), 522 states have internal predecessors, (737), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:08:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 749 transitions. [2024-11-07 23:08:58,391 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 749 transitions. Word has length 167 [2024-11-07 23:08:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:08:58,392 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 749 transitions. [2024-11-07 23:08:58,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:08:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 749 transitions. [2024-11-07 23:08:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 23:08:58,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:08:58,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:08:58,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 23:08:58,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:08:58,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:08:58,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2124470064, now seen corresponding path program 1 times [2024-11-07 23:08:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:08:58,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712053670] [2024-11-07 23:08:58,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:08:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:08:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:58,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:08:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:58,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:08:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 23:08:58,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:08:58,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712053670] [2024-11-07 23:08:58,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712053670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:08:58,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:08:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:08:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942968748] [2024-11-07 23:08:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:08:58,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 23:08:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:08:58,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 23:08:58,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 23:08:58,644 INFO L87 Difference]: Start difference. First operand 530 states and 749 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:08:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:08:58,912 INFO L93 Difference]: Finished difference Result 934 states and 1322 transitions. [2024-11-07 23:08:58,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 23:08:58,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-11-07 23:08:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:08:58,915 INFO L225 Difference]: With dead ends: 934 [2024-11-07 23:08:58,915 INFO L226 Difference]: Without dead ends: 539 [2024-11-07 23:08:58,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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 23:08:58,917 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 5 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 23:08:58,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1543 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 23:08:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-07 23:08:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 536. [2024-11-07 23:08:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 526 states have (on average 1.4125475285171103) internal successors, (743), 528 states have internal predecessors, (743), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:08:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 755 transitions. [2024-11-07 23:08:58,932 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 755 transitions. Word has length 167 [2024-11-07 23:08:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:08:58,932 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 755 transitions. [2024-11-07 23:08:58,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:08:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 755 transitions. [2024-11-07 23:08:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 23:08:58,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:08:58,934 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:08:58,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 23:08:58,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:08:58,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:08:58,935 INFO L85 PathProgramCache]: Analyzing trace with hash 586130034, now seen corresponding path program 1 times [2024-11-07 23:08:58,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:08:58,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816077967] [2024-11-07 23:08:58,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:08:58,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:08:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:59,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:08:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:59,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:08:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 23:08:59,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:08:59,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816077967] [2024-11-07 23:08:59,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816077967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:08:59,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:08:59,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:08:59,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927433405] [2024-11-07 23:08:59,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:08:59,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 23:08:59,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:08:59,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 23:08:59,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 23:08:59,164 INFO L87 Difference]: Start difference. First operand 536 states and 755 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:08:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:08:59,559 INFO L93 Difference]: Finished difference Result 1134 states and 1602 transitions. [2024-11-07 23:08:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 23:08:59,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-11-07 23:08:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:08:59,563 INFO L225 Difference]: With dead ends: 1134 [2024-11-07 23:08:59,564 INFO L226 Difference]: Without dead ends: 733 [2024-11-07 23:08:59,564 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 23:08:59,565 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 322 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 23:08:59,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1570 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 23:08:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-07 23:08:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 730. [2024-11-07 23:08:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 717 states have (on average 1.408647140864714) internal successors, (1010), 719 states have internal predecessors, (1010), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 23:08:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1028 transitions. [2024-11-07 23:08:59,583 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1028 transitions. Word has length 167 [2024-11-07 23:08:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:08:59,584 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1028 transitions. [2024-11-07 23:08:59,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:08:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1028 transitions. [2024-11-07 23:08:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 23:08:59,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:08:59,586 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:08:59,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 23:08:59,586 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:08:59,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:08:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1457835018, now seen corresponding path program 1 times [2024-11-07 23:08:59,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:08:59,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77286154] [2024-11-07 23:08:59,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:08:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:08:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:59,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:08:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:59,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:08:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:59,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 23:08:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:59,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 23:08:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:08:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:08:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:08:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77286154] [2024-11-07 23:08:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77286154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:08:59,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:08:59,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:08:59,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039782420] [2024-11-07 23:08:59,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:08:59,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 23:08:59,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:08:59,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 23:08:59,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 23:08:59,916 INFO L87 Difference]: Start difference. First operand 730 states and 1028 transitions. Second operand has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:09:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:09:00,497 INFO L93 Difference]: Finished difference Result 799 states and 1129 transitions. [2024-11-07 23:09:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 23:09:00,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2024-11-07 23:09:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:09:00,505 INFO L225 Difference]: With dead ends: 799 [2024-11-07 23:09:00,505 INFO L226 Difference]: Without dead ends: 797 [2024-11-07 23:09:00,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 23:09:00,506 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 374 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 23:09:00,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 2105 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 23:09:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-07 23:09:00,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 794. [2024-11-07 23:09:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 778 states have (on average 1.398457583547558) internal successors, (1088), 780 states have internal predecessors, (1088), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:09:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1112 transitions. [2024-11-07 23:09:00,527 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1112 transitions. Word has length 182 [2024-11-07 23:09:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:09:00,527 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1112 transitions. [2024-11-07 23:09:00,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:09:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1112 transitions. [2024-11-07 23:09:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 23:09:00,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:09:00,530 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:09:00,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 23:09:00,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:09:00,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:09:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1287954457, now seen corresponding path program 1 times [2024-11-07 23:09:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:09:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294859637] [2024-11-07 23:09:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:09:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:09:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:01,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:09:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:01,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 23:09:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:01,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 23:09:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 23:09:01,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:09:01,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294859637] [2024-11-07 23:09:01,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294859637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:09:01,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741595113] [2024-11-07 23:09:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:01,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:09:01,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:09:01,330 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 23:09:01,331 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 23:09:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:01,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 23:09:01,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:09:01,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 23:09:01,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 23:09:02,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 23:09:02,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2024-11-07 23:09:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:09:02,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 23:09:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741595113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:09:02,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 23:09:02,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-07 23:09:02,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116037290] [2024-11-07 23:09:02,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:09:02,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 23:09:02,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:09:02,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 23:09:02,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-07 23:09:02,622 INFO L87 Difference]: Start difference. First operand 794 states and 1112 transitions. Second operand has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 11 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:09:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:09:05,838 INFO L93 Difference]: Finished difference Result 1553 states and 2170 transitions. [2024-11-07 23:09:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 23:09:05,838 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 11 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2024-11-07 23:09:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:09:05,841 INFO L225 Difference]: With dead ends: 1553 [2024-11-07 23:09:05,841 INFO L226 Difference]: Without dead ends: 847 [2024-11-07 23:09:05,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-07 23:09:05,843 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 820 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 4032 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 23:09:05,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 4032 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1467 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 23:09:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-07 23:09:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 828. [2024-11-07 23:09:05,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 812 states have (on average 1.3928571428571428) internal successors, (1131), 814 states have internal predecessors, (1131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:09:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1155 transitions. [2024-11-07 23:09:05,860 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1155 transitions. Word has length 188 [2024-11-07 23:09:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:09:05,860 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1155 transitions. [2024-11-07 23:09:05,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 11 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:09:05,861 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1155 transitions. [2024-11-07 23:09:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 23:09:05,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:09:05,862 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:09:05,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 23:09:06,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:09:06,067 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:09:06,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:09:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1603143653, now seen corresponding path program 1 times [2024-11-07 23:09:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:09:06,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081728631] [2024-11-07 23:09:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:09:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:06,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:09:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:06,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:09:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 23:09:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 23:09:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:09:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:09:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081728631] [2024-11-07 23:09:06,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081728631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:09:06,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:09:06,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 23:09:06,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891174530] [2024-11-07 23:09:06,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:09:06,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 23:09:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:09:06,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 23:09:06,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 23:09:06,226 INFO L87 Difference]: Start difference. First operand 828 states and 1155 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:09:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:09:06,490 INFO L93 Difference]: Finished difference Result 1499 states and 2098 transitions. [2024-11-07 23:09:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 23:09:06,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2024-11-07 23:09:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:09:06,493 INFO L225 Difference]: With dead ends: 1499 [2024-11-07 23:09:06,493 INFO L226 Difference]: Without dead ends: 701 [2024-11-07 23:09:06,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 23:09:06,494 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 12 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 23:09:06,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1739 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 23:09:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-07 23:09:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 698. [2024-11-07 23:09:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 682 states have (on average 1.3592375366568914) internal successors, (927), 684 states have internal predecessors, (927), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:09:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 951 transitions. [2024-11-07 23:09:06,508 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 951 transitions. Word has length 188 [2024-11-07 23:09:06,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:09:06,509 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 951 transitions. [2024-11-07 23:09:06,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:09:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 951 transitions. [2024-11-07 23:09:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 23:09:06,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:09:06,510 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:09:06,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 23:09:06,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:09:06,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:09:06,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1953126337, now seen corresponding path program 1 times [2024-11-07 23:09:06,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:09:06,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510922914] [2024-11-07 23:09:06,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:06,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:09:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 23:09:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:07,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 23:09:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:07,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 23:09:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:07,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 23:09:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 23:09:07,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:09:07,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510922914] [2024-11-07 23:09:07,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510922914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:09:07,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322383719] [2024-11-07 23:09:07,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:07,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:09:07,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:09:07,061 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 23:09:07,062 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 23:09:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:07,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 23:09:07,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:09:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:09:07,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 23:09:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322383719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:09:07,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 23:09:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-07 23:09:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498209928] [2024-11-07 23:09:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:09:07,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 23:09:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:09:07,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 23:09:07,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:09:07,511 INFO L87 Difference]: Start difference. First operand 698 states and 951 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:09:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:09:07,605 INFO L93 Difference]: Finished difference Result 1356 states and 1860 transitions. [2024-11-07 23:09:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 23:09:07,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2024-11-07 23:09:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:09:07,608 INFO L225 Difference]: With dead ends: 1356 [2024-11-07 23:09:07,608 INFO L226 Difference]: Without dead ends: 698 [2024-11-07 23:09:07,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:09:07,610 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 13 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 23:09:07,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1279 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 23:09:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-07 23:09:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-07 23:09:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 682 states have (on average 1.3563049853372433) internal successors, (925), 684 states have internal predecessors, (925), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:09:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 949 transitions. [2024-11-07 23:09:07,626 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 949 transitions. Word has length 189 [2024-11-07 23:09:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:09:07,626 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 949 transitions. [2024-11-07 23:09:07,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:09:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 949 transitions. [2024-11-07 23:09:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 23:09:07,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:09:07,628 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:09:07,643 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 23:09:07,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:09:07,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:09:07,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:09:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1539485556, now seen corresponding path program 1 times [2024-11-07 23:09:07,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:09:07,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752012072] [2024-11-07 23:09:07,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:09:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 23:09:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:08,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 23:09:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:08,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 23:09:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:08,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 23:09:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:09:08,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:09:08,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752012072] [2024-11-07 23:09:08,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752012072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:09:08,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:09:08,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 23:09:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174024157] [2024-11-07 23:09:08,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:09:08,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 23:09:08,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:09:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 23:09:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:09:08,194 INFO L87 Difference]: Start difference. First operand 698 states and 949 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:09:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:09:08,561 INFO L93 Difference]: Finished difference Result 1362 states and 1877 transitions. [2024-11-07 23:09:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 23:09:08,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2024-11-07 23:09:08,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:09:08,565 INFO L225 Difference]: With dead ends: 1362 [2024-11-07 23:09:08,565 INFO L226 Difference]: Without dead ends: 707 [2024-11-07 23:09:08,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:09:08,566 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 7 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 23:09:08,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2039 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 23:09:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-07 23:09:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 704. [2024-11-07 23:09:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 688 states have (on average 1.3531976744186047) internal successors, (931), 690 states have internal predecessors, (931), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:09:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 955 transitions. [2024-11-07 23:09:08,582 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 955 transitions. Word has length 190 [2024-11-07 23:09:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:09:08,583 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 955 transitions. [2024-11-07 23:09:08,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:09:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 955 transitions. [2024-11-07 23:09:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 23:09:08,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:09:08,585 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:09:08,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 23:09:08,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:09:08,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:09:08,585 INFO L85 PathProgramCache]: Analyzing trace with hash 148056766, now seen corresponding path program 1 times [2024-11-07 23:09:08,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:09:08,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326296044] [2024-11-07 23:09:08,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:09:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:09,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:09:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:09,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 23:09:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:09,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 23:09:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:09,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 23:09:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 23:09:09,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:09:09,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326296044] [2024-11-07 23:09:09,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326296044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:09:09,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446337472] [2024-11-07 23:09:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:09,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:09:09,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:09:09,135 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 23:09:09,137 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 23:09:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:09,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 23:09:09,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:09:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 23:09:09,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 23:09:09,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446337472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:09:09,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 23:09:09,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-11-07 23:09:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536497960] [2024-11-07 23:09:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:09:09,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 23:09:09,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:09:09,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 23:09:09,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 23:09:09,716 INFO L87 Difference]: Start difference. First operand 704 states and 955 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:09:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:09:10,105 INFO L93 Difference]: Finished difference Result 1253 states and 1697 transitions. [2024-11-07 23:09:10,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 23:09:10,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 191 [2024-11-07 23:09:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:09:10,108 INFO L225 Difference]: With dead ends: 1253 [2024-11-07 23:09:10,108 INFO L226 Difference]: Without dead ends: 786 [2024-11-07 23:09:10,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 23:09:10,109 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 12 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 23:09:10,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2233 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 23:09:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-07 23:09:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 778. [2024-11-07 23:09:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 762 states have (on average 1.337270341207349) internal successors, (1019), 764 states have internal predecessors, (1019), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:09:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1043 transitions. [2024-11-07 23:09:10,125 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1043 transitions. Word has length 191 [2024-11-07 23:09:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:09:10,125 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1043 transitions. [2024-11-07 23:09:10,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:09:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1043 transitions. [2024-11-07 23:09:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 23:09:10,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:09:10,127 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:09:10,160 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 23:09:10,327 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,SelfDestructingSolverStorable12 [2024-11-07 23:09:10,327 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:09:10,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:09:10,327 INFO L85 PathProgramCache]: Analyzing trace with hash 217565898, now seen corresponding path program 1 times [2024-11-07 23:09:10,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:09:10,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619284451] [2024-11-07 23:09:10,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:10,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:09:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:09:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 23:09:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 23:09:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:10,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 23:09:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:09:10,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:09:10,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619284451] [2024-11-07 23:09:10,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619284451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:09:10,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:09:10,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 23:09:10,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581004942] [2024-11-07 23:09:10,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:09:10,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 23:09:10,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:09:10,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 23:09:10,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 23:09:10,718 INFO L87 Difference]: Start difference. First operand 778 states and 1043 transitions. Second operand has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 8 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:09:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:09:11,406 INFO L93 Difference]: Finished difference Result 1311 states and 1778 transitions. [2024-11-07 23:09:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 23:09:11,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 8 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 192 [2024-11-07 23:09:11,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:09:11,409 INFO L225 Difference]: With dead ends: 1311 [2024-11-07 23:09:11,409 INFO L226 Difference]: Without dead ends: 817 [2024-11-07 23:09:11,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 23:09:11,410 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 28 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 23:09:11,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2490 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 23:09:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-11-07 23:09:11,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 796. [2024-11-07 23:09:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 780 states have (on average 1.3397435897435896) internal successors, (1045), 782 states have internal predecessors, (1045), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:09:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1069 transitions. [2024-11-07 23:09:11,424 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1069 transitions. Word has length 192 [2024-11-07 23:09:11,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:09:11,424 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1069 transitions. [2024-11-07 23:09:11,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 8 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:09:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1069 transitions. [2024-11-07 23:09:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 23:09:11,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:09:11,426 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:09:11,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 23:09:11,426 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:09:11,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:09:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2001197486, now seen corresponding path program 1 times [2024-11-07 23:09:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:09:11,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500080113] [2024-11-07 23:09:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:09:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:11,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:09:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:11,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 23:09:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 23:09:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:11,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 23:09:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:09:11,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:09:11,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500080113] [2024-11-07 23:09:11,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500080113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:09:11,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:09:11,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 23:09:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558415249] [2024-11-07 23:09:11,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:09:11,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 23:09:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:09:11,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 23:09:11,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 23:09:11,925 INFO L87 Difference]: Start difference. First operand 796 states and 1069 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:09:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:09:12,764 INFO L93 Difference]: Finished difference Result 1335 states and 1811 transitions. [2024-11-07 23:09:12,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 23:09:12,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 193 [2024-11-07 23:09:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:09:12,767 INFO L225 Difference]: With dead ends: 1335 [2024-11-07 23:09:12,767 INFO L226 Difference]: Without dead ends: 827 [2024-11-07 23:09:12,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-07 23:09:12,774 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 35 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 23:09:12,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3298 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 23:09:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-07 23:09:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 812. [2024-11-07 23:09:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 796 states have (on average 1.3379396984924623) internal successors, (1065), 798 states have internal predecessors, (1065), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:09:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1089 transitions. [2024-11-07 23:09:12,809 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1089 transitions. Word has length 193 [2024-11-07 23:09:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:09:12,811 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1089 transitions. [2024-11-07 23:09:12,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:09:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1089 transitions. [2024-11-07 23:09:12,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 23:09:12,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:09:12,812 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:09:12,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 23:09:12,813 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:09:12,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:09:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1090269785, now seen corresponding path program 1 times [2024-11-07 23:09:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:09:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111941608] [2024-11-07 23:09:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:12,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:09:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:13,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:09:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:13,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 23:09:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:13,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 23:09:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:13,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 23:09:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:09:13,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:09:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111941608] [2024-11-07 23:09:13,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111941608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:09:13,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:09:13,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 23:09:13,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214404904] [2024-11-07 23:09:13,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:09:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 23:09:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:09:13,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 23:09:13,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 23:09:13,264 INFO L87 Difference]: Start difference. First operand 812 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:09:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:09:13,834 INFO L93 Difference]: Finished difference Result 1343 states and 1818 transitions. [2024-11-07 23:09:13,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 23:09:13,836 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 193 [2024-11-07 23:09:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:09:13,838 INFO L225 Difference]: With dead ends: 1343 [2024-11-07 23:09:13,839 INFO L226 Difference]: Without dead ends: 825 [2024-11-07 23:09:13,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 23:09:13,840 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 15 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2479 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 23:09:13,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2479 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 23:09:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-11-07 23:09:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 818. [2024-11-07 23:09:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 802 states have (on average 1.3354114713216958) internal successors, (1071), 804 states have internal predecessors, (1071), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:09:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1095 transitions. [2024-11-07 23:09:13,854 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1095 transitions. Word has length 193 [2024-11-07 23:09:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:09:13,855 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1095 transitions. [2024-11-07 23:09:13,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:09:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1095 transitions. [2024-11-07 23:09:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-07 23:09:13,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:09:13,857 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:09:13,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 23:09:13,857 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:09:13,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:09:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1834389433, now seen corresponding path program 1 times [2024-11-07 23:09:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:09:13,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82336090] [2024-11-07 23:09:13,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:13,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:09:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:09:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 23:09:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:14,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 23:09:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 23:09:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 23:09:14,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:09:14,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82336090] [2024-11-07 23:09:14,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82336090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:09:14,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007074060] [2024-11-07 23:09:14,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:14,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:09:14,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:09:14,344 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 23:09:14,351 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 23:09:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:14,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 23:09:15,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:09:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 23:09:15,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 23:09:15,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007074060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:09:15,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 23:09:15,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-07 23:09:15,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734625675] [2024-11-07 23:09:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:09:15,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 23:09:15,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:09:15,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 23:09:15,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:09:15,036 INFO L87 Difference]: Start difference. First operand 818 states and 1095 transitions. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:09:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:09:15,121 INFO L93 Difference]: Finished difference Result 1546 states and 2086 transitions. [2024-11-07 23:09:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 23:09:15,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 194 [2024-11-07 23:09:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:09:15,124 INFO L225 Difference]: With dead ends: 1546 [2024-11-07 23:09:15,124 INFO L226 Difference]: Without dead ends: 821 [2024-11-07 23:09:15,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:09:15,126 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 445 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 23:09:15,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1987 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 23:09:15,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-07 23:09:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2024-11-07 23:09:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 804 states have (on average 1.335820895522388) internal successors, (1074), 807 states have internal predecessors, (1074), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-07 23:09:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1102 transitions. [2024-11-07 23:09:15,151 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1102 transitions. Word has length 194 [2024-11-07 23:09:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:09:15,152 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1102 transitions. [2024-11-07 23:09:15,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:09:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1102 transitions. [2024-11-07 23:09:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-07 23:09:15,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:09:15,154 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:09:15,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 23:09:15,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 23:09:15,356 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:09:15,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:09:15,356 INFO L85 PathProgramCache]: Analyzing trace with hash 712142279, now seen corresponding path program 1 times [2024-11-07 23:09:15,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:09:15,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527687395] [2024-11-07 23:09:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:15,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:09:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:15,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:09:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:16,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 23:09:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:16,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 23:09:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 23:09:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-07 23:09:16,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:09:16,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527687395] [2024-11-07 23:09:16,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527687395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:09:16,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084876887] [2024-11-07 23:09:16,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:16,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:09:16,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:09:16,081 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 23:09:16,083 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 23:09:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:16,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 23:09:16,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:09:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:09:16,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:09:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-07 23:09:17,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084876887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:09:17,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:09:17,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 15 [2024-11-07 23:09:17,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671469343] [2024-11-07 23:09:17,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:09:17,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 23:09:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:09:17,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 23:09:17,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-07 23:09:17,275 INFO L87 Difference]: Start difference. First operand 821 states and 1102 transitions. Second operand has 15 states, 15 states have (on average 24.2) internal successors, (363), 14 states have internal predecessors, (363), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-07 23:09:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:09:17,728 INFO L93 Difference]: Finished difference Result 1560 states and 2116 transitions. [2024-11-07 23:09:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 23:09:17,728 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 24.2) internal successors, (363), 14 states have internal predecessors, (363), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 198 [2024-11-07 23:09:17,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:09:17,731 INFO L225 Difference]: With dead ends: 1560 [2024-11-07 23:09:17,731 INFO L226 Difference]: Without dead ends: 830 [2024-11-07 23:09:17,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-07 23:09:17,732 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 391 mSDsluCounter, 3900 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 23:09:17,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 4410 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 23:09:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-07 23:09:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2024-11-07 23:09:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 812 states have (on average 1.3374384236453203) internal successors, (1086), 815 states have internal predecessors, (1086), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-07 23:09:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1114 transitions. [2024-11-07 23:09:17,749 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1114 transitions. Word has length 198 [2024-11-07 23:09:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:09:17,749 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1114 transitions. [2024-11-07 23:09:17,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 24.2) internal successors, (363), 14 states have internal predecessors, (363), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-07 23:09:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1114 transitions. [2024-11-07 23:09:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 23:09:17,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:09:17,751 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:09:17,769 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 23:09:17,951 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,SelfDestructingSolverStorable17 [2024-11-07 23:09:17,952 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:09:17,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:09:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash -273323769, now seen corresponding path program 2 times [2024-11-07 23:09:17,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:09:17,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661034804] [2024-11-07 23:09:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:09:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:09:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:18,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:09:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:18,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 23:09:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 23:09:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:18,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 23:09:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:09:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-07 23:09:18,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:09:18,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661034804] [2024-11-07 23:09:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661034804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:09:18,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533949292] [2024-11-07 23:09:18,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 23:09:18,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:09:18,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:09:18,878 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 23:09:18,879 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 23:09:19,711 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 23:09:19,711 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:09:19,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 245 conjuncts are in the unsatisfiable core [2024-11-07 23:09:19,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:09:19,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 23:09:19,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 23:09:20,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-07 23:09:20,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-07 23:09:20,376 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-07 23:09:20,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-07 23:09:20,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 23:09:20,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 23:09:20,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-07 23:09:20,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-07 23:09:20,629 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 23:09:20,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-07 23:09:20,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-07 23:10:14,709 WARN L286 SmtUtils]: Spent 49.11s on a formula simplification. DAG size of input: 52366 DAG size of output: 1 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-07 23:10:14,709 INFO L349 Elim1Store]: treesize reduction 1060308, result has 0.0 percent of original size [2024-11-07 23:10:14,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 241 stores, 25 select indices, 25 select index equivalence classes, 1 disjoint index pairs (out of 300 index pairs), introduced 287 new quantified variables, introduced 6562 case distinctions, treesize of input 3077417439 treesize of output 819841624