./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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_BER_test5-1.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 df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:12:59,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:12:59,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:12:59,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:12:59,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:12:59,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:12:59,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:12:59,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:12:59,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:12:59,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:12:59,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:12:59,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:12:59,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:12:59,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:12:59,768 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:12:59,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:12:59,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:12:59,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:12:59,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:12:59,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:12:59,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:12:59,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:12:59,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:12:59,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:12:59,770 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:12:59,770 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:12:59,771 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:12:59,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:12:59,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:12:59,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:12:59,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:12:59,772 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:12:59,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:12:59,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:12:59,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:12:59,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:12:59,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:12:59,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:12:59,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:12:59,772 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 -> df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c [2025-01-10 06:13:00,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:13:00,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:13:00,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:13:00,057 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:13:00,057 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:13:00,058 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_BER_test5-1.i [2025-01-10 06:13:01,379 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e85b57a0/982449c303814b71a8add58ebb3cf350/FLAG918337f82 [2025-01-10 06:13:01,718 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:13:01,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2025-01-10 06:13:01,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e85b57a0/982449c303814b71a8add58ebb3cf350/FLAG918337f82 [2025-01-10 06:13:01,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e85b57a0/982449c303814b71a8add58ebb3cf350 [2025-01-10 06:13:01,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:13:01,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:13:01,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:13:01,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:13:01,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:13:01,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:13:01" (1/1) ... [2025-01-10 06:13:01,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2235f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:01, skipping insertion in model container [2025-01-10 06:13:01,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:13:01" (1/1) ... [2025-01-10 06:13:01,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:13:02,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:13:02,343 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:13:02,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:13:02,500 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:13:02,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02 WrapperNode [2025-01-10 06:13:02,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:13:02,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:13:02,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:13:02,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:13:02,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,606 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1984 [2025-01-10 06:13:02,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:13:02,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:13:02,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:13:02,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:13:02,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,734 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2025-01-10 06:13:02,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:13:02,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:13:02,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:13:02,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:13:02,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (1/1) ... [2025-01-10 06:13:02,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:13:02,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:02,856 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) [2025-01-10 06:13:02,859 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 [2025-01-10 06:13:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 06:13:02,882 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 06:13:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:13:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:13:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:13:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 06:13:02,882 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 06:13:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:13:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:13:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:13:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:13:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:13:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 06:13:02,882 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:13:02,882 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:13:02,882 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:13:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:13:02,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:13:03,126 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:13:03,127 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:13:05,085 INFO L? ?]: Removed 491 outVars from TransFormulas that were not future-live. [2025-01-10 06:13:05,086 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:13:05,108 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:13:05,109 INFO L312 CfgBuilder]: Removed 39 assume(true) statements. [2025-01-10 06:13:05,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:13:05 BoogieIcfgContainer [2025-01-10 06:13:05,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:13:05,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:13:05,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:13:05,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:13:05,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:13:01" (1/3) ... [2025-01-10 06:13:05,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff26e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:13:05, skipping insertion in model container [2025-01-10 06:13:05,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:13:02" (2/3) ... [2025-01-10 06:13:05,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff26e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:13:05, skipping insertion in model container [2025-01-10 06:13:05,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:13:05" (3/3) ... [2025-01-10 06:13:05,117 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-1.i [2025-01-10 06:13:05,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:13:05,135 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test5-1.i that has 6 procedures, 592 locations, 1 initial locations, 49 loop locations, and 10 error locations. [2025-01-10 06:13:05,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:13:05,218 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;@58829fb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:13:05,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 06:13:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 584 states, 557 states have (on average 1.6211849192100538) internal successors, (903), 574 states have internal predecessors, (903), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:13:05,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 06:13:05,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:05,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:13:05,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:05,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash 59738978, now seen corresponding path program 1 times [2025-01-10 06:13:05,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:05,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226586405] [2025-01-10 06:13:05,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:05,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:05,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:13:05,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:13:05,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:05,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:13:05,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:05,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226586405] [2025-01-10 06:13:05,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226586405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:05,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:05,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:13:05,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515846106] [2025-01-10 06:13:05,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:05,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:13:05,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:05,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:13:05,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:13:05,404 INFO L87 Difference]: Start difference. First operand has 584 states, 557 states have (on average 1.6211849192100538) internal successors, (903), 574 states have internal predecessors, (903), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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) [2025-01-10 06:13:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:05,485 INFO L93 Difference]: Finished difference Result 1162 states and 1860 transitions. [2025-01-10 06:13:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:13:05,492 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-01-10 06:13:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:05,508 INFO L225 Difference]: With dead ends: 1162 [2025-01-10 06:13:05,508 INFO L226 Difference]: Without dead ends: 574 [2025-01-10 06:13:05,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:13:05,518 INFO L435 NwaCegarLoop]: 840 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, 840 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 [2025-01-10 06:13:05,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:13:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-01-10 06:13:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2025-01-10 06:13:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 553 states have (on average 1.4665461121157324) internal successors, (811), 565 states have internal predecessors, (811), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 06:13:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 833 transitions. [2025-01-10 06:13:05,590 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 833 transitions. Word has length 5 [2025-01-10 06:13:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:05,590 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 833 transitions. [2025-01-10 06:13:05,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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) [2025-01-10 06:13:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 833 transitions. [2025-01-10 06:13:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 06:13:05,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:05,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:13:05,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:13:05,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:05,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1851909864, now seen corresponding path program 1 times [2025-01-10 06:13:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:05,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320955524] [2025-01-10 06:13:05,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:05,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:05,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:13:05,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:13:05,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:05,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:13:05,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:05,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320955524] [2025-01-10 06:13:05,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320955524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:05,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:05,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:13:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469195794] [2025-01-10 06:13:05,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:05,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:13:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:05,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:13:05,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:13:05,676 INFO L87 Difference]: Start difference. First operand 574 states and 833 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-01-10 06:13:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:05,806 INFO L93 Difference]: Finished difference Result 1310 states and 1916 transitions. [2025-01-10 06:13:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:13:05,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-01-10 06:13:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:05,816 INFO L225 Difference]: With dead ends: 1310 [2025-01-10 06:13:05,817 INFO L226 Difference]: Without dead ends: 1130 [2025-01-10 06:13:05,818 INFO L434 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 [2025-01-10 06:13:05,819 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 791 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:05,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1691 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:13:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-01-10 06:13:05,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 749. [2025-01-10 06:13:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 723 states have (on average 1.4702627939142463) internal successors, (1063), 740 states have internal predecessors, (1063), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:13:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1095 transitions. [2025-01-10 06:13:05,871 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1095 transitions. Word has length 6 [2025-01-10 06:13:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:05,872 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1095 transitions. [2025-01-10 06:13:05,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-01-10 06:13:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1095 transitions. [2025-01-10 06:13:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-10 06:13:05,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:05,878 INFO L218 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] [2025-01-10 06:13:05,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:13:05,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:05,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1280126307, now seen corresponding path program 1 times [2025-01-10 06:13:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:05,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395985190] [2025-01-10 06:13:05,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:05,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-10 06:13:06,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-10 06:13:06,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:06,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:13:06,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:06,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395985190] [2025-01-10 06:13:06,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395985190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:06,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:06,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:13:06,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61086619] [2025-01-10 06:13:06,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:06,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:13:06,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:06,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:13:06,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:13:06,724 INFO L87 Difference]: Start difference. First operand 749 states and 1095 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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) [2025-01-10 06:13:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:06,848 INFO L93 Difference]: Finished difference Result 1449 states and 2117 transitions. [2025-01-10 06:13:06,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:13:06,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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 149 [2025-01-10 06:13:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:06,855 INFO L225 Difference]: With dead ends: 1449 [2025-01-10 06:13:06,855 INFO L226 Difference]: Without dead ends: 707 [2025-01-10 06:13:06,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:13:06,857 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 30 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:06,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2177 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:13:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-01-10 06:13:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-01-10 06:13:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 681 states have (on average 1.447870778267254) internal successors, (986), 698 states have internal predecessors, (986), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:13:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1018 transitions. [2025-01-10 06:13:06,890 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1018 transitions. Word has length 149 [2025-01-10 06:13:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:06,890 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1018 transitions. [2025-01-10 06:13:06,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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) [2025-01-10 06:13:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1018 transitions. [2025-01-10 06:13:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-10 06:13:06,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:06,902 INFO L218 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] [2025-01-10 06:13:06,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:13:06,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:06,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1676100777, now seen corresponding path program 1 times [2025-01-10 06:13:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:06,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926561777] [2025-01-10 06:13:06,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:07,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-10 06:13:07,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-10 06:13:07,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:07,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:13:07,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:07,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926561777] [2025-01-10 06:13:07,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926561777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:07,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:07,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:13:07,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961429425] [2025-01-10 06:13:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:07,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:13:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:07,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:13:07,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:13:07,205 INFO L87 Difference]: Start difference. First operand 707 states and 1018 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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) [2025-01-10 06:13:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:07,265 INFO L93 Difference]: Finished difference Result 1491 states and 2145 transitions. [2025-01-10 06:13:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:13:07,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 149 [2025-01-10 06:13:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:07,296 INFO L225 Difference]: With dead ends: 1491 [2025-01-10 06:13:07,297 INFO L226 Difference]: Without dead ends: 791 [2025-01-10 06:13:07,298 INFO L434 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 [2025-01-10 06:13:07,300 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 58 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1491 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 [2025-01-10 06:13:07,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1491 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:13:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-01-10 06:13:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2025-01-10 06:13:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 765 states have (on average 1.4392156862745098) internal successors, (1101), 782 states have internal predecessors, (1101), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:13:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1133 transitions. [2025-01-10 06:13:07,333 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1133 transitions. Word has length 149 [2025-01-10 06:13:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:07,333 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1133 transitions. [2025-01-10 06:13:07,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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) [2025-01-10 06:13:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1133 transitions. [2025-01-10 06:13:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-10 06:13:07,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:07,336 INFO L218 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] [2025-01-10 06:13:07,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:13:07,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:07,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash 349038778, now seen corresponding path program 1 times [2025-01-10 06:13:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018847514] [2025-01-10 06:13:07,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:07,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 06:13:07,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 06:13:07,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:07,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:13:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018847514] [2025-01-10 06:13:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018847514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:07,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:07,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:13:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489497861] [2025-01-10 06:13:07,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:07,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:13:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:07,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:13:07,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:13:07,721 INFO L87 Difference]: Start difference. First operand 791 states and 1133 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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) [2025-01-10 06:13:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:07,814 INFO L93 Difference]: Finished difference Result 1494 states and 2147 transitions. [2025-01-10 06:13:07,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:13:07,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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 164 [2025-01-10 06:13:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:07,820 INFO L225 Difference]: With dead ends: 1494 [2025-01-10 06:13:07,820 INFO L226 Difference]: Without dead ends: 794 [2025-01-10 06:13:07,822 INFO L434 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 [2025-01-10 06:13:07,824 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 105 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:07,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2076 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:13:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-01-10 06:13:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 791. [2025-01-10 06:13:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 765 states have (on average 1.4300653594771242) internal successors, (1094), 782 states have internal predecessors, (1094), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:13:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1126 transitions. [2025-01-10 06:13:07,856 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1126 transitions. Word has length 164 [2025-01-10 06:13:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:07,856 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1126 transitions. [2025-01-10 06:13:07,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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) [2025-01-10 06:13:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1126 transitions. [2025-01-10 06:13:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-10 06:13:07,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:07,860 INFO L218 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] [2025-01-10 06:13:07,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:13:07,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:07,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:07,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1192846382, now seen corresponding path program 1 times [2025-01-10 06:13:07,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:07,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523431477] [2025-01-10 06:13:07,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:07,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:07,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 06:13:07,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 06:13:07,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:07,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:13:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:08,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523431477] [2025-01-10 06:13:08,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523431477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:08,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:08,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:13:08,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396107188] [2025-01-10 06:13:08,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:08,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:13:08,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:08,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:13:08,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:13:08,198 INFO L87 Difference]: Start difference. First operand 791 states and 1126 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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) [2025-01-10 06:13:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:08,285 INFO L93 Difference]: Finished difference Result 1852 states and 2660 transitions. [2025-01-10 06:13:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:13:08,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 164 [2025-01-10 06:13:08,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:08,294 INFO L225 Difference]: With dead ends: 1852 [2025-01-10 06:13:08,294 INFO L226 Difference]: Without dead ends: 1152 [2025-01-10 06:13:08,296 INFO L434 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 [2025-01-10 06:13:08,296 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 462 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:08,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1666 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:13:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-01-10 06:13:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1147. [2025-01-10 06:13:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1108 states have (on average 1.44043321299639) internal successors, (1596), 1135 states have internal predecessors, (1596), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 13 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:13:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1654 transitions. [2025-01-10 06:13:08,335 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1654 transitions. Word has length 164 [2025-01-10 06:13:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:08,336 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1654 transitions. [2025-01-10 06:13:08,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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) [2025-01-10 06:13:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1654 transitions. [2025-01-10 06:13:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-10 06:13:08,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:08,338 INFO L218 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] [2025-01-10 06:13:08,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:13:08,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:08,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:08,339 INFO L85 PathProgramCache]: Analyzing trace with hash -817266467, now seen corresponding path program 1 times [2025-01-10 06:13:08,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:08,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881599388] [2025-01-10 06:13:08,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:08,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:08,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-10 06:13:08,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-10 06:13:08,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:08,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:13:08,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:08,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881599388] [2025-01-10 06:13:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881599388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:08,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:08,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:13:08,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381387635] [2025-01-10 06:13:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:08,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:13:08,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:08,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:13:08,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:13:08,809 INFO L87 Difference]: Start difference. First operand 1147 states and 1654 transitions. Second operand has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 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) [2025-01-10 06:13:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:08,895 INFO L93 Difference]: Finished difference Result 1215 states and 1740 transitions. [2025-01-10 06:13:08,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:13:08,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 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 179 [2025-01-10 06:13:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:08,902 INFO L225 Difference]: With dead ends: 1215 [2025-01-10 06:13:08,903 INFO L226 Difference]: Without dead ends: 1213 [2025-01-10 06:13:08,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:13:08,905 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 541 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:08,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 2272 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:13:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-01-10 06:13:08,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1211. [2025-01-10 06:13:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1169 states have (on average 1.4319931565440547) internal successors, (1674), 1196 states have internal predecessors, (1674), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-10 06:13:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1738 transitions. [2025-01-10 06:13:08,944 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1738 transitions. Word has length 179 [2025-01-10 06:13:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:08,945 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1738 transitions. [2025-01-10 06:13:08,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 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) [2025-01-10 06:13:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1738 transitions. [2025-01-10 06:13:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-10 06:13:08,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:08,947 INFO L218 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] [2025-01-10 06:13:08,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:13:08,947 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:08,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:08,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2110808548, now seen corresponding path program 1 times [2025-01-10 06:13:08,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:08,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633238868] [2025-01-10 06:13:08,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:08,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:09,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-10 06:13:09,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-10 06:13:09,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:09,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:13:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633238868] [2025-01-10 06:13:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633238868] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863270900] [2025-01-10 06:13:09,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:09,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:09,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:09,985 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) [2025-01-10 06:13:09,988 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 [2025-01-10 06:13:10,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-10 06:13:10,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-10 06:13:10,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:10,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:10,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 06:13:10,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:10,641 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 [2025-01-10 06:13:10,663 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 [2025-01-10 06:13:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:13:11,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:11,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863270900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:11,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:11,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-10 06:13:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189702087] [2025-01-10 06:13:11,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:11,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:13:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:11,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:13:11,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:13:11,496 INFO L87 Difference]: Start difference. First operand 1211 states and 1738 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 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) [2025-01-10 06:13:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:12,767 INFO L93 Difference]: Finished difference Result 2394 states and 3439 transitions. [2025-01-10 06:13:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:13:12,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 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 185 [2025-01-10 06:13:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:12,774 INFO L225 Difference]: With dead ends: 2394 [2025-01-10 06:13:12,774 INFO L226 Difference]: Without dead ends: 1227 [2025-01-10 06:13:12,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-10 06:13:12,777 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 826 mSDsluCounter, 3465 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:12,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 4243 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 06:13:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-01-10 06:13:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1211. [2025-01-10 06:13:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1169 states have (on average 1.4311377245508983) internal successors, (1673), 1196 states have internal predecessors, (1673), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-10 06:13:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1737 transitions. [2025-01-10 06:13:12,818 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1737 transitions. Word has length 185 [2025-01-10 06:13:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:12,818 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1737 transitions. [2025-01-10 06:13:12,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 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) [2025-01-10 06:13:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1737 transitions. [2025-01-10 06:13:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-10 06:13:12,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:12,820 INFO L218 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] [2025-01-10 06:13:12,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:13:13,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:13,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:13,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1537457782, now seen corresponding path program 1 times [2025-01-10 06:13:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:13,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044077566] [2025-01-10 06:13:13,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:13,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-10 06:13:13,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 06:13:13,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:13,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:13:13,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:13,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044077566] [2025-01-10 06:13:13,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044077566] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:13,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325109280] [2025-01-10 06:13:13,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:13,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:13,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:13,738 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) [2025-01-10 06:13:13,740 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 [2025-01-10 06:13:14,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-10 06:13:14,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 06:13:14,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:14,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:14,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 06:13:14,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:13:14,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:14,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325109280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:14,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:14,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:13:14,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782737793] [2025-01-10 06:13:14,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:14,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:13:14,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:14,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:13:14,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:13:14,392 INFO L87 Difference]: Start difference. First operand 1211 states and 1737 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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) [2025-01-10 06:13:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:14,528 INFO L93 Difference]: Finished difference Result 2378 states and 3424 transitions. [2025-01-10 06:13:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:13:14,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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 186 [2025-01-10 06:13:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:14,534 INFO L225 Difference]: With dead ends: 2378 [2025-01-10 06:13:14,534 INFO L226 Difference]: Without dead ends: 1211 [2025-01-10 06:13:14,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:13:14,536 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 17 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2071 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 [2025-01-10 06:13:14,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2071 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:13:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-01-10 06:13:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1211. [2025-01-10 06:13:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1169 states have (on average 1.429426860564585) internal successors, (1671), 1196 states have internal predecessors, (1671), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-10 06:13:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1735 transitions. [2025-01-10 06:13:14,570 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1735 transitions. Word has length 186 [2025-01-10 06:13:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:14,570 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1735 transitions. [2025-01-10 06:13:14,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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) [2025-01-10 06:13:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1735 transitions. [2025-01-10 06:13:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-10 06:13:14,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:14,573 INFO L218 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] [2025-01-10 06:13:14,585 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 [2025-01-10 06:13:14,773 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 [2025-01-10 06:13:14,774 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:14,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash 651887849, now seen corresponding path program 1 times [2025-01-10 06:13:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462578473] [2025-01-10 06:13:14,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:14,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-10 06:13:14,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-10 06:13:14,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:14,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:13:15,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:15,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462578473] [2025-01-10 06:13:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462578473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:15,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:15,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:13:15,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918490320] [2025-01-10 06:13:15,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:15,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:13:15,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:15,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:13:15,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:13:15,313 INFO L87 Difference]: Start difference. First operand 1211 states and 1735 transitions. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 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) [2025-01-10 06:13:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:15,554 INFO L93 Difference]: Finished difference Result 2381 states and 3426 transitions. [2025-01-10 06:13:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:13:15,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 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 187 [2025-01-10 06:13:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:15,560 INFO L225 Difference]: With dead ends: 2381 [2025-01-10 06:13:15,560 INFO L226 Difference]: Without dead ends: 1217 [2025-01-10 06:13:15,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:13:15,563 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 8 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:15,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2728 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:13:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-01-10 06:13:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2025-01-10 06:13:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1175 states have (on average 1.4272340425531915) internal successors, (1677), 1202 states have internal predecessors, (1677), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-10 06:13:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1741 transitions. [2025-01-10 06:13:15,602 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1741 transitions. Word has length 187 [2025-01-10 06:13:15,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:15,602 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1741 transitions. [2025-01-10 06:13:15,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 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) [2025-01-10 06:13:15,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1741 transitions. [2025-01-10 06:13:15,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 06:13:15,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:15,604 INFO L218 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] [2025-01-10 06:13:15,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:13:15,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:15,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:15,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1971996973, now seen corresponding path program 1 times [2025-01-10 06:13:15,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:15,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204976287] [2025-01-10 06:13:15,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:15,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:15,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:13:16,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:13:16,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:16,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:13:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204976287] [2025-01-10 06:13:16,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204976287] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655890618] [2025-01-10 06:13:16,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:16,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:16,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:16,441 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) [2025-01-10 06:13:16,443 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 [2025-01-10 06:13:16,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:13:17,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:13:17,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:17,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:17,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 06:13:17,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:13:17,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:17,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655890618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:17,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:17,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 11 [2025-01-10 06:13:17,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307588872] [2025-01-10 06:13:17,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:17,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:13:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:17,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:13:17,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:13:17,267 INFO L87 Difference]: Start difference. First operand 1217 states and 1741 transitions. Second operand has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 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) [2025-01-10 06:13:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:17,704 INFO L93 Difference]: Finished difference Result 2290 states and 3288 transitions. [2025-01-10 06:13:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:13:17,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 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 188 [2025-01-10 06:13:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:17,711 INFO L225 Difference]: With dead ends: 2290 [2025-01-10 06:13:17,711 INFO L226 Difference]: Without dead ends: 1307 [2025-01-10 06:13:17,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:13:17,714 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 30 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:17,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3343 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:13:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2025-01-10 06:13:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1283. [2025-01-10 06:13:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1241 states have (on average 1.4174053182917001) internal successors, (1759), 1268 states have internal predecessors, (1759), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-10 06:13:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1823 transitions. [2025-01-10 06:13:17,758 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1823 transitions. Word has length 188 [2025-01-10 06:13:17,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:17,759 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1823 transitions. [2025-01-10 06:13:17,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 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) [2025-01-10 06:13:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1823 transitions. [2025-01-10 06:13:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-10 06:13:17,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:17,762 INFO L218 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] [2025-01-10 06:13:17,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:13:17,962 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 [2025-01-10 06:13:17,963 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:17,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash -29330767, now seen corresponding path program 1 times [2025-01-10 06:13:17,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:17,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410472072] [2025-01-10 06:13:17,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:17,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:18,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:13:18,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:13:18,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:18,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:13:18,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:18,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410472072] [2025-01-10 06:13:18,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410472072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:18,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:18,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:13:18,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366849296] [2025-01-10 06:13:18,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:18,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:13:18,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:18,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:13:18,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:13:18,697 INFO L87 Difference]: Start difference. First operand 1283 states and 1823 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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) [2025-01-10 06:13:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:19,503 INFO L93 Difference]: Finished difference Result 2316 states and 3310 transitions. [2025-01-10 06:13:19,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:13:19,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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 189 [2025-01-10 06:13:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:19,510 INFO L225 Difference]: With dead ends: 2316 [2025-01-10 06:13:19,511 INFO L226 Difference]: Without dead ends: 1301 [2025-01-10 06:13:19,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:13:19,514 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 20 mSDsluCounter, 2945 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3680 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:19,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3680 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 06:13:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2025-01-10 06:13:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1277. [2025-01-10 06:13:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1235 states have (on average 1.4161943319838057) internal successors, (1749), 1262 states have internal predecessors, (1749), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-10 06:13:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1813 transitions. [2025-01-10 06:13:19,554 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1813 transitions. Word has length 189 [2025-01-10 06:13:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:19,555 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1813 transitions. [2025-01-10 06:13:19,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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) [2025-01-10 06:13:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1813 transitions. [2025-01-10 06:13:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-10 06:13:19,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:19,558 INFO L218 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] [2025-01-10 06:13:19,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:13:19,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:19,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash -708494008, now seen corresponding path program 1 times [2025-01-10 06:13:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:19,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426989248] [2025-01-10 06:13:19,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:19,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:19,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-10 06:13:19,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-10 06:13:19,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:19,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:13:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:20,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426989248] [2025-01-10 06:13:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426989248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:20,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:20,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:13:20,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799398835] [2025-01-10 06:13:20,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:20,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:13:20,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:20,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:13:20,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:13:20,137 INFO L87 Difference]: Start difference. First operand 1277 states and 1813 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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) [2025-01-10 06:13:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:20,605 INFO L93 Difference]: Finished difference Result 2315 states and 3307 transitions. [2025-01-10 06:13:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:13:20,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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 190 [2025-01-10 06:13:20,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:20,612 INFO L225 Difference]: With dead ends: 2315 [2025-01-10 06:13:20,613 INFO L226 Difference]: Without dead ends: 1305 [2025-01-10 06:13:20,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:13:20,616 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 16 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:20,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2566 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:13:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2025-01-10 06:13:20,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1285. [2025-01-10 06:13:20,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1243 states have (on average 1.415124698310539) internal successors, (1759), 1270 states have internal predecessors, (1759), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-10 06:13:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1823 transitions. [2025-01-10 06:13:20,655 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1823 transitions. Word has length 190 [2025-01-10 06:13:20,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:20,655 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1823 transitions. [2025-01-10 06:13:20,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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) [2025-01-10 06:13:20,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1823 transitions. [2025-01-10 06:13:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-10 06:13:20,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:20,658 INFO L218 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] [2025-01-10 06:13:20,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:13:20,660 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:20,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1657586074, now seen corresponding path program 1 times [2025-01-10 06:13:20,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:20,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109012504] [2025-01-10 06:13:20,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:20,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:20,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:13:20,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:13:20,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:20,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:13:21,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:21,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109012504] [2025-01-10 06:13:21,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109012504] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:21,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975269278] [2025-01-10 06:13:21,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:21,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:21,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:21,297 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) [2025-01-10 06:13:21,300 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 [2025-01-10 06:13:21,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:13:22,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:13:22,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:22,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:22,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:13:22,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:13:22,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:22,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975269278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:22,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:22,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-10 06:13:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417904426] [2025-01-10 06:13:22,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:22,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:13:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:22,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:13:22,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:13:22,415 INFO L87 Difference]: Start difference. First operand 1285 states and 1823 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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) [2025-01-10 06:13:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:22,467 INFO L93 Difference]: Finished difference Result 2476 states and 3534 transitions. [2025-01-10 06:13:22,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:13:22,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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 191 [2025-01-10 06:13:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:22,474 INFO L225 Difference]: With dead ends: 2476 [2025-01-10 06:13:22,475 INFO L226 Difference]: Without dead ends: 1288 [2025-01-10 06:13:22,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:13:22,478 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 0 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:22,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2207 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:13:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-01-10 06:13:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1288. [2025-01-10 06:13:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1245 states have (on average 1.4152610441767068) internal successors, (1762), 1273 states have internal predecessors, (1762), 32 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-01-10 06:13:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2025-01-10 06:13:22,517 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 191 [2025-01-10 06:13:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:22,517 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2025-01-10 06:13:22,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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) [2025-01-10 06:13:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2025-01-10 06:13:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-10 06:13:22,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:22,520 INFO L218 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] [2025-01-10 06:13:22,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:13:22,720 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,SelfDestructingSolverStorable13 [2025-01-10 06:13:22,721 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:13:22,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:22,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1152604778, now seen corresponding path program 1 times [2025-01-10 06:13:22,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:22,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356269074] [2025-01-10 06:13:22,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:22,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:22,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:13:23,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:13:23,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:23,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:13:23,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:23,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356269074] [2025-01-10 06:13:23,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356269074] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:23,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274025944] [2025-01-10 06:13:23,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:23,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:23,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:23,641 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) [2025-01-10 06:13:23,644 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 [2025-01-10 06:13:24,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:13:24,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:13:24,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:24,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:24,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-01-10 06:13:24,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:24,704 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 [2025-01-10 06:13:24,745 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 [2025-01-10 06:13:25,162 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 [2025-01-10 06:13:25,182 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 [2025-01-10 06:13:25,198 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 [2025-01-10 06:13:25,204 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 [2025-01-10 06:13:25,210 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 15 treesize of output 1 [2025-01-10 06:13:25,230 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-01-10 06:13:25,230 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 [2025-01-10 06:13:25,323 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 [2025-01-10 06:13:25,330 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 [2025-01-10 06:13:25,336 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 [2025-01-10 06:13:25,526 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:13:25,526 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 66 treesize of output 57 [2025-01-10 06:13:25,540 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 [2025-01-10 06:13:25,548 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 [2025-01-10 06:13:34,568 INFO L224 Elim1Store]: Index analysis took 470 ms