./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound10.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b879e9957df47aa9212d1bcb19c90b87b865d954f1a44f3c044747ce0553d2eb'] 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/nla-digbench-scaling/divbin_unwindbound10.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 b879e9957df47aa9212d1bcb19c90b87b865d954f1a44f3c044747ce0553d2eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:19:57,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:19:57,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 20:19:57,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:19:57,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:19:57,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:19:57,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:19:57,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:19:57,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:19:57,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:19:57,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:19:57,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:19:57,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:19:57,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:19:57,472 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:19:57,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:19:57,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:19:57,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:19:57,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:19:57,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:19:57,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:19:57,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:19:57,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:19:57,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:19:57,473 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:19:57,473 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:19:57,473 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:19:57,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:19:57,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:19:57,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:19:57,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:19:57,474 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 -> b879e9957df47aa9212d1bcb19c90b87b865d954f1a44f3c044747ce0553d2eb [2024-11-07 20:19:57,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:19:57,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:19:57,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:19:57,692 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:19:57,692 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:19:57,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound10.i [2024-11-07 20:19:58,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:19:58,962 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:19:58,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound10.i [2024-11-07 20:19:58,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59e9ab322/a329d1de95f3425f9fdd5e63d4263df8/FLAGaf4374c7f [2024-11-07 20:19:59,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59e9ab322/a329d1de95f3425f9fdd5e63d4263df8 [2024-11-07 20:19:59,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:19:59,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:19:59,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:19:59,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:19:59,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:19:59,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31562168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59, skipping insertion in model container [2024-11-07 20:19:59,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:19:59,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:19:59,435 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:19:59,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:19:59,460 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:19:59,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59 WrapperNode [2024-11-07 20:19:59,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:19:59,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:19:59,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:19:59,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:19:59,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,484 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-11-07 20:19:59,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:19:59,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:19:59,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:19:59,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:19:59,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,504 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 20:19:59,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:19:59,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:19:59,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:19:59,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:19:59,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (1/1) ... [2024-11-07 20:19:59,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:19:59,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:59,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 20:19:59,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 20:19:59,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:19:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 20:19:59,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 20:19:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:19:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:19:59,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:19:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 20:19:59,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 20:19:59,620 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:19:59,622 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:19:59,727 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 20:19:59,728 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:19:59,737 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:19:59,737 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 20:19:59,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:59 BoogieIcfgContainer [2024-11-07 20:19:59,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:19:59,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:19:59,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:19:59,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:19:59,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:19:59" (1/3) ... [2024-11-07 20:19:59,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112c7470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:59, skipping insertion in model container [2024-11-07 20:19:59,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:59" (2/3) ... [2024-11-07 20:19:59,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112c7470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:59, skipping insertion in model container [2024-11-07 20:19:59,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:59" (3/3) ... [2024-11-07 20:19:59,744 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound10.i [2024-11-07 20:19:59,754 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:19:59,754 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 20:19:59,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:19:59,792 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;@7d242351, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:19:59,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 20:19:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 20:19:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:19:59,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:59,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:59,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:59,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:59,806 INFO L85 PathProgramCache]: Analyzing trace with hash -604571617, now seen corresponding path program 1 times [2024-11-07 20:19:59,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:59,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671120356] [2024-11-07 20:19:59,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:19:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:59,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:19:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:19:59,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671120356] [2024-11-07 20:19:59,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671120356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:59,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:19:59,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:19:59,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485173707] [2024-11-07 20:19:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:59,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 20:19:59,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:59,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 20:19:59,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 20:19:59,916 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:19:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:59,929 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2024-11-07 20:19:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 20:19:59,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-07 20:19:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:59,934 INFO L225 Difference]: With dead ends: 70 [2024-11-07 20:19:59,934 INFO L226 Difference]: Without dead ends: 29 [2024-11-07 20:19:59,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 20:19:59,939 INFO L432 NwaCegarLoop]: 42 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, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:59,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-07 20:19:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-07 20:19:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 20:19:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-07 20:19:59,967 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2024-11-07 20:19:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:59,967 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-07 20:19:59,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:19:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-07 20:19:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:19:59,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:59,969 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:59,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:19:59,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:59,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:59,970 INFO L85 PathProgramCache]: Analyzing trace with hash 153751263, now seen corresponding path program 1 times [2024-11-07 20:19:59,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:59,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073486566] [2024-11-07 20:19:59,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:59,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:00,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:00,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073486566] [2024-11-07 20:20:00,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073486566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:20:00,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:20:00,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:20:00,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640444595] [2024-11-07 20:20:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:20:00,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:20:00,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:20:00,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:20:00,094 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:20:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:00,140 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-07 20:20:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:20:00,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 15 [2024-11-07 20:20:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:00,142 INFO L225 Difference]: With dead ends: 34 [2024-11-07 20:20:00,142 INFO L226 Difference]: Without dead ends: 33 [2024-11-07 20:20:00,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:20:00,142 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:00,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:20:00,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-07 20:20:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-07 20:20:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 20:20:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-07 20:20:00,146 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2024-11-07 20:20:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:00,147 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-07 20:20:00,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:20:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-07 20:20:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 20:20:00,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:20:00,147 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:00,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:20:00,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:20:00,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:20:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash 471321901, now seen corresponding path program 1 times [2024-11-07 20:20:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:20:00,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242782571] [2024-11-07 20:20:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:00,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:20:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:00,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:00,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242782571] [2024-11-07 20:20:00,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242782571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:20:00,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:20:00,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:20:00,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467283676] [2024-11-07 20:20:00,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:20:00,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:20:00,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:20:00,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:20:00,209 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:20:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:00,237 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-07 20:20:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:20:00,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 16 [2024-11-07 20:20:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:00,239 INFO L225 Difference]: With dead ends: 46 [2024-11-07 20:20:00,239 INFO L226 Difference]: Without dead ends: 32 [2024-11-07 20:20:00,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:20:00,240 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:00,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:20:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-07 20:20:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-07 20:20:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 20:20:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-07 20:20:00,245 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2024-11-07 20:20:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:00,245 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-07 20:20:00,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:20:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-07 20:20:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 20:20:00,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:20:00,246 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:00,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:20:00,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:20:00,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:20:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2080735310, now seen corresponding path program 1 times [2024-11-07 20:20:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:20:00,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698396152] [2024-11-07 20:20:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:20:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:00,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:00,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698396152] [2024-11-07 20:20:00,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698396152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:20:00,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:20:00,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:20:00,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248895225] [2024-11-07 20:20:00,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:20:00,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:20:00,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:00,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:20:00,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:20:00,338 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:20:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:00,420 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-07 20:20:00,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 20:20:00,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 20 [2024-11-07 20:20:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:00,421 INFO L225 Difference]: With dead ends: 32 [2024-11-07 20:20:00,421 INFO L226 Difference]: Without dead ends: 31 [2024-11-07 20:20:00,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:20:00,422 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:00,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 63 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:20:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-07 20:20:00,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-07 20:20:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 20:20:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-07 20:20:00,428 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2024-11-07 20:20:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:00,429 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-07 20:20:00,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:20:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-07 20:20:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 20:20:00,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:20:00,430 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:00,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:20:00,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:20:00,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:20:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash -78285105, now seen corresponding path program 1 times [2024-11-07 20:20:00,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:20:00,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763487086] [2024-11-07 20:20:00,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:00,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:20:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:00,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:00,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763487086] [2024-11-07 20:20:00,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763487086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:20:00,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:20:00,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:20:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520270239] [2024-11-07 20:20:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:20:00,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:20:00,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:00,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:20:00,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:20:00,522 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:20:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:00,581 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-07 20:20:00,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 20:20:00,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 21 [2024-11-07 20:20:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:00,582 INFO L225 Difference]: With dead ends: 41 [2024-11-07 20:20:00,582 INFO L226 Difference]: Without dead ends: 40 [2024-11-07 20:20:00,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:20:00,582 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:00,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:20:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-07 20:20:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-11-07 20:20:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 20:20:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-07 20:20:00,586 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 21 [2024-11-07 20:20:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:00,586 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-07 20:20:00,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:20:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-07 20:20:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 20:20:00,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:20:00,587 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:00,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 20:20:00,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:20:00,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:20:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash -78246376, now seen corresponding path program 1 times [2024-11-07 20:20:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:20:00,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611891281] [2024-11-07 20:20:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:00,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:20:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:00,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611891281] [2024-11-07 20:20:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611891281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:20:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131356027] [2024-11-07 20:20:00,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:00,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:00,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:20:00,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:20:00,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 20:20:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 20:20:00,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:20:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:00,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:20:00,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131356027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:20:00,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:20:00,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-07 20:20:00,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844602331] [2024-11-07 20:20:00,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:20:00,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:20:00,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:00,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:20:00,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:20:00,741 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:20:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:00,778 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-07 20:20:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:20:00,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 21 [2024-11-07 20:20:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:00,780 INFO L225 Difference]: With dead ends: 39 [2024-11-07 20:20:00,780 INFO L226 Difference]: Without dead ends: 38 [2024-11-07 20:20:00,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 20:20:00,780 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:00,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:20:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-07 20:20:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2024-11-07 20:20:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 20:20:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-07 20:20:00,786 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2024-11-07 20:20:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:00,786 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-07 20:20:00,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:20:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-07 20:20:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 20:20:00,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:20:00,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:00,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 20:20:00,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:00,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:20:00,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:20:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 654806120, now seen corresponding path program 1 times [2024-11-07 20:20:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:20:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216241904] [2024-11-07 20:20:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:00,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:20:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:01,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:01,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:01,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:01,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216241904] [2024-11-07 20:20:01,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216241904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:20:01,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612857721] [2024-11-07 20:20:01,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:01,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:01,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:20:01,044 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:20:01,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 20:20:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:01,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:20:01,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:20:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:01,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:20:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:01,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612857721] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:20:01,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:20:01,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-07 20:20:01,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213728590] [2024-11-07 20:20:01,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:20:01,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 20:20:01,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:01,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 20:20:01,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-07 20:20:01,166 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 20:20:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:01,260 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-07 20:20:01,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 20:20:01,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 25 [2024-11-07 20:20:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:01,261 INFO L225 Difference]: With dead ends: 68 [2024-11-07 20:20:01,261 INFO L226 Difference]: Without dead ends: 56 [2024-11-07 20:20:01,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-07 20:20:01,263 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:01,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:20:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-07 20:20:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-11-07 20:20:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 20:20:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-11-07 20:20:01,269 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2024-11-07 20:20:01,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:01,269 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-11-07 20:20:01,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 20:20:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-07 20:20:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 20:20:01,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:20:01,270 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:01,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 20:20:01,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:01,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:20:01,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:20:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1174269756, now seen corresponding path program 1 times [2024-11-07 20:20:01,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:20:01,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067545213] [2024-11-07 20:20:01,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:01,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:20:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:01,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:01,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:01,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067545213] [2024-11-07 20:20:01,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067545213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:20:01,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184200681] [2024-11-07 20:20:01,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:01,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:01,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:20:01,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:20:01,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 20:20:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:01,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 20:20:01,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:20:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:01,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:20:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:01,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184200681] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:20:01,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:20:01,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-07 20:20:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264746435] [2024-11-07 20:20:01,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:20:01,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 20:20:01,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:01,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 20:20:01,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-07 20:20:01,743 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 20:20:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:01,988 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2024-11-07 20:20:01,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 20:20:01,989 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 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 26 [2024-11-07 20:20:01,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:01,990 INFO L225 Difference]: With dead ends: 77 [2024-11-07 20:20:01,990 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 20:20:01,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-11-07 20:20:01,991 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 98 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:01,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 147 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:20:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 20:20:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-11-07 20:20:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 20:20:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-11-07 20:20:02,000 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 26 [2024-11-07 20:20:02,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:02,001 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-07 20:20:02,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 20:20:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-11-07 20:20:02,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 20:20:02,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:20:02,002 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:02,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 20:20:02,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:02,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:20:02,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:20:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash 749470151, now seen corresponding path program 1 times [2024-11-07 20:20:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:20:02,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666067183] [2024-11-07 20:20:02,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:02,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:20:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:02,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:02,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:02,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:20:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:02,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 20:20:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:02,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 20:20:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 20:20:02,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:02,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666067183] [2024-11-07 20:20:02,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666067183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:20:02,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240729599] [2024-11-07 20:20:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:02,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:02,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:20:02,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:20:02,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 20:20:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:02,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 20:20:02,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:20:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:02,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:20:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 20:20:02,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240729599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:20:02,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:20:02,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-07 20:20:02,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197064945] [2024-11-07 20:20:02,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:20:02,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 20:20:02,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:02,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 20:20:02,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-07 20:20:02,773 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-07 20:20:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:03,224 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2024-11-07 20:20:03,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-07 20:20:03,224 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 54 [2024-11-07 20:20:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:03,225 INFO L225 Difference]: With dead ends: 223 [2024-11-07 20:20:03,226 INFO L226 Difference]: Without dead ends: 222 [2024-11-07 20:20:03,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-11-07 20:20:03,228 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 226 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:03,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 198 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:20:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-07 20:20:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 169. [2024-11-07 20:20:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 141 states have (on average 1.127659574468085) internal successors, (159), 141 states have internal predecessors, (159), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 20:20:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 187 transitions. [2024-11-07 20:20:03,245 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 187 transitions. Word has length 54 [2024-11-07 20:20:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:03,246 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 187 transitions. [2024-11-07 20:20:03,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-07 20:20:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 187 transitions. [2024-11-07 20:20:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 20:20:03,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:20:03,248 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:03,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 20:20:03,448 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,SelfDestructingSolverStorable8 [2024-11-07 20:20:03,448 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:20:03,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:20:03,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1527022909, now seen corresponding path program 1 times [2024-11-07 20:20:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:20:03,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532270183] [2024-11-07 20:20:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:20:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:03,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:03,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 20:20:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:03,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 20:20:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 20:20:03,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:03,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532270183] [2024-11-07 20:20:03,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532270183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:20:03,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906822053] [2024-11-07 20:20:03,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:03,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:03,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:20:03,615 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:20:03,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 20:20:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:03,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 20:20:03,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:20:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 20:20:03,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:20:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 20:20:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906822053] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:20:03,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:20:03,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2024-11-07 20:20:03,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118666952] [2024-11-07 20:20:03,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:20:03,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 20:20:03,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:03,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 20:20:03,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-07 20:20:03,841 INFO L87 Difference]: Start difference. First operand 169 states and 187 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 20:20:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:04,088 INFO L93 Difference]: Finished difference Result 249 states and 281 transitions. [2024-11-07 20:20:04,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 20:20:04,088 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-11-07 20:20:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:04,089 INFO L225 Difference]: With dead ends: 249 [2024-11-07 20:20:04,089 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 20:20:04,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 20:20:04,090 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 179 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:04,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 136 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:20:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 20:20:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 199. [2024-11-07 20:20:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.1403508771929824) internal successors, (195), 171 states have internal predecessors, (195), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 20:20:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 223 transitions. [2024-11-07 20:20:04,108 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 223 transitions. Word has length 62 [2024-11-07 20:20:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:04,109 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 223 transitions. [2024-11-07 20:20:04,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 20:20:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 223 transitions. [2024-11-07 20:20:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 20:20:04,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:20:04,111 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:04,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 20:20:04,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 20:20:04,312 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:20:04,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:20:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1343796701, now seen corresponding path program 2 times [2024-11-07 20:20:04,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:20:04,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131553999] [2024-11-07 20:20:04,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:04,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:20:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 20:20:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 20:20:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-07 20:20:04,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131553999] [2024-11-07 20:20:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131553999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:20:04,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:20:04,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:20:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102908056] [2024-11-07 20:20:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:20:04,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:20:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:20:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:20:04,395 INFO L87 Difference]: Start difference. First operand 199 states and 223 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:20:04,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:04,421 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2024-11-07 20:20:04,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:20:04,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 92 [2024-11-07 20:20:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:04,423 INFO L225 Difference]: With dead ends: 225 [2024-11-07 20:20:04,423 INFO L226 Difference]: Without dead ends: 199 [2024-11-07 20:20:04,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:20:04,423 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:04,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:20:04,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-07 20:20:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 155. [2024-11-07 20:20:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.1181102362204725) internal successors, (142), 127 states have internal predecessors, (142), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 20:20:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2024-11-07 20:20:04,434 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 92 [2024-11-07 20:20:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:04,434 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2024-11-07 20:20:04,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:20:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2024-11-07 20:20:04,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 20:20:04,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:20:04,435 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:04,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 20:20:04,435 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:20:04,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:20:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1694985668, now seen corresponding path program 1 times [2024-11-07 20:20:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:20:04,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806035782] [2024-11-07 20:20:04,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:20:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 20:20:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 20:20:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 20:20:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 20:20:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 20:20:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 20:20:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 20:20:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 20:20:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-07 20:20:04,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:04,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806035782] [2024-11-07 20:20:04,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806035782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:20:04,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459529119] [2024-11-07 20:20:04,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:04,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:04,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:20:04,903 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:20:04,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 20:20:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:04,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 20:20:04,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:20:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:20:05,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:20:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-07 20:20:06,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459529119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:20:06,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:20:06,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 64 [2024-11-07 20:20:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510972830] [2024-11-07 20:20:06,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:20:06,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-07 20:20:06,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-07 20:20:06,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=941, Invalid=3219, Unknown=0, NotChecked=0, Total=4160 [2024-11-07 20:20:06,072 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 65 states, 64 states have (on average 3.390625) internal successors, (217), 65 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-11-07 20:20:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:07,383 INFO L93 Difference]: Finished difference Result 533 states and 600 transitions. [2024-11-07 20:20:07,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-11-07 20:20:07,384 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 3.390625) internal successors, (217), 65 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) Word has length 114 [2024-11-07 20:20:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:07,386 INFO L225 Difference]: With dead ends: 533 [2024-11-07 20:20:07,386 INFO L226 Difference]: Without dead ends: 532 [2024-11-07 20:20:07,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4347, Invalid=11403, Unknown=0, NotChecked=0, Total=15750 [2024-11-07 20:20:07,389 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 512 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:07,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 347 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:20:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-07 20:20:07,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 325. [2024-11-07 20:20:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 267 states have (on average 1.1161048689138577) internal successors, (298), 267 states have internal predecessors, (298), 29 states have call successors, (29), 28 states have call predecessors, (29), 28 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 20:20:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 356 transitions. [2024-11-07 20:20:07,401 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 356 transitions. Word has length 114 [2024-11-07 20:20:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:07,401 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 356 transitions. [2024-11-07 20:20:07,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 3.390625) internal successors, (217), 65 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-11-07 20:20:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 356 transitions. [2024-11-07 20:20:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-07 20:20:07,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:20:07,403 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:07,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 20:20:07,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 20:20:07,604 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:20:07,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:20:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1939354457, now seen corresponding path program 2 times [2024-11-07 20:20:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:20:07,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376427853] [2024-11-07 20:20:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:20:07,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:20:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:20:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:20:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:20:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:20:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 20:20:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 20:20:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 20:20:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 20:20:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 20:20:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 20:20:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 20:20:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 20:20:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 20:20:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 20:20:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 20:20:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 20:20:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 20:20:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 20:20:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 20:20:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 20:20:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-07 20:20:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 244 proven. 7 refuted. 0 times theorem prover too weak. 1706 trivial. 0 not checked. [2024-11-07 20:20:07,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:07,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376427853] [2024-11-07 20:20:07,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376427853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:20:07,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103813352] [2024-11-07 20:20:07,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 20:20:07,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:07,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:20:07,852 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:20:07,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 20:20:07,946 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 20:20:07,947 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:20:07,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 20:20:07,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:20:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 1231 proven. 7 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2024-11-07 20:20:08,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:20:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 811 proven. 7 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2024-11-07 20:20:08,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103813352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:20:08,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:20:08,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 23, 24] total 29 [2024-11-07 20:20:08,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198061309] [2024-11-07 20:20:08,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:20:08,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-07 20:20:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-07 20:20:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2024-11-07 20:20:08,546 INFO L87 Difference]: Start difference. First operand 325 states and 356 transitions. Second operand has 29 states, 29 states have (on average 4.551724137931035) internal successors, (132), 29 states have internal predecessors, (132), 12 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2024-11-07 20:20:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:09,119 INFO L93 Difference]: Finished difference Result 840 states and 919 transitions. [2024-11-07 20:20:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-07 20:20:09,119 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.551724137931035) internal successors, (132), 29 states have internal predecessors, (132), 12 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) Word has length 240 [2024-11-07 20:20:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:09,119 INFO L225 Difference]: With dead ends: 840 [2024-11-07 20:20:09,119 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 20:20:09,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 487 SyntacticMatches, 21 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=918, Invalid=3504, Unknown=0, NotChecked=0, Total=4422 [2024-11-07 20:20:09,122 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 89 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:09,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 896 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:20:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 20:20:09,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 20:20:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:20:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 20:20:09,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2024-11-07 20:20:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:09,123 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 20:20:09,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.551724137931035) internal successors, (132), 29 states have internal predecessors, (132), 12 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2024-11-07 20:20:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 20:20:09,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 20:20:09,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-07 20:20:09,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-07 20:20:09,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-07 20:20:09,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-07 20:20:09,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 20:20:09,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:09,330 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:09,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 20:20:10,436 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 20:20:10,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:20:10 BoogieIcfgContainer [2024-11-07 20:20:10,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 20:20:10,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 20:20:10,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 20:20:10,449 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 20:20:10,449 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:59" (3/4) ... [2024-11-07 20:20:10,451 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 20:20:10,454 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 20:20:10,454 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-07 20:20:10,456 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-07 20:20:10,456 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 20:20:10,456 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 20:20:10,456 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 20:20:10,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 20:20:10,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 20:20:10,509 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 20:20:10,510 INFO L158 Benchmark]: Toolchain (without parser) took 11182.72ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 85.0MB in the beginning and 178.5MB in the end (delta: -93.5MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-11-07 20:20:10,510 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:20:10,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 133.70ms. Allocated memory is still 109.1MB. Free memory was 84.8MB in the beginning and 74.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:20:10,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.46ms. Allocated memory is still 109.1MB. Free memory was 74.0MB in the beginning and 72.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:20:10,511 INFO L158 Benchmark]: Boogie Preprocessor took 31.49ms. Allocated memory is still 109.1MB. Free memory was 72.7MB in the beginning and 71.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:20:10,511 INFO L158 Benchmark]: RCFGBuilder took 220.81ms. Allocated memory is still 109.1MB. Free memory was 71.4MB in the beginning and 60.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:20:10,512 INFO L158 Benchmark]: TraceAbstraction took 10709.18ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 60.0MB in the beginning and 184.1MB in the end (delta: -124.1MB). Peak memory consumption was 107.5MB. Max. memory is 16.1GB. [2024-11-07 20:20:10,512 INFO L158 Benchmark]: Witness Printer took 59.90ms. Allocated memory is still 234.9MB. Free memory was 184.1MB in the beginning and 178.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:20:10,513 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 133.70ms. Allocated memory is still 109.1MB. Free memory was 84.8MB in the beginning and 74.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.46ms. Allocated memory is still 109.1MB. Free memory was 74.0MB in the beginning and 72.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.49ms. Allocated memory is still 109.1MB. Free memory was 72.7MB in the beginning and 71.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 220.81ms. Allocated memory is still 109.1MB. Free memory was 71.4MB in the beginning and 60.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10709.18ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 60.0MB in the beginning and 184.1MB in the end (delta: -124.1MB). Peak memory consumption was 107.5MB. Max. memory is 16.1GB. * Witness Printer took 59.90ms. Allocated memory is still 234.9MB. Free memory was 184.1MB in the beginning and 178.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1227 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1227 mSDsluCounter, 2331 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1939 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1633 IncrementalHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 392 mSDtfsCounter, 1633 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1441 GetRequests, 1059 SyntacticMatches, 21 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5928 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=12, InterpolantAutomatonStates: 285, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 356 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1263 NumberOfCodeBlocks, 1263 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1758 ConstructedInterpolants, 0 QuantifiedInterpolants, 3306 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1314 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 6538/7604 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((11 <= counter) && (counter <= 2147483645)) || ((counter <= 3) && (1 <= counter))) || ((counter <= 10) && (3 <= counter))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((2 <= counter) && (counter <= 10)) || (counter == 0)) || (counter == 1)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((counter == 0) && (counter == \old(counter))) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-07 20:20:10,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE