./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.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/loop-invgen/apache-escape-absolute.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', 'b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5'] 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/loop-invgen/apache-escape-absolute.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 b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:06:46,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:06:46,086 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:06:46,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:06:46,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:06:46,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:06:46,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:06:46,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:06:46,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:06:46,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:06:46,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:06:46,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:06:46,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:06:46,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:06:46,115 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:06:46,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:06:46,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:06:46,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:06:46,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:06:46,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:06:46,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:06:46,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:06:46,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:06:46,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:06:46,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:06:46,116 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:06:46,116 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:06:46,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:06:46,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:06:46,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:06:46,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:06:46,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:06:46,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:06:46,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:06:46,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:06:46,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:06:46,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:06:46,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:06:46,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:06:46,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:06:46,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:06:46,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:06:46,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:06:46,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:06:46,118 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 -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2024-11-07 20:06:46,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:06:46,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:06:46,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:06:46,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:06:46,448 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:06:46,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-11-07 20:06:47,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:06:47,993 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:06:47,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-11-07 20:06:48,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec4ecab92/06227a1dbc18441db0e4de2b410631d6/FLAG1e05baa49 [2024-11-07 20:06:48,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec4ecab92/06227a1dbc18441db0e4de2b410631d6 [2024-11-07 20:06:48,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:06:48,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:06:48,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:06:48,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:06:48,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:06:48,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6830fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48, skipping insertion in model container [2024-11-07 20:06:48,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:06:48,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:06:48,246 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:06:48,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:06:48,282 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:06:48,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48 WrapperNode [2024-11-07 20:06:48,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:06:48,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:06:48,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:06:48,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:06:48,289 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:06:48" (1/1) ... [2024-11-07 20:06:48,294 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:06:48" (1/1) ... [2024-11-07 20:06:48,313 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 160 [2024-11-07 20:06:48,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:06:48,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:06:48,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:06:48,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:06:48,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,339 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:06:48,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:06:48,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:06:48,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:06:48,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:06:48,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48" (1/1) ... [2024-11-07 20:06:48,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:06:48,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:48,392 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:06:48,396 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:06:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:06:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:06:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:06:48,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:06:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 20:06:48,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 20:06:48,476 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:06:48,478 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:06:48,745 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-07 20:06:48,745 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:06:48,769 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:06:48,769 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 20:06:48,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:06:48 BoogieIcfgContainer [2024-11-07 20:06:48,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:06:48,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:06:48,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:06:48,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:06:48,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:06:48" (1/3) ... [2024-11-07 20:06:48,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46704808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:06:48, skipping insertion in model container [2024-11-07 20:06:48,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:48" (2/3) ... [2024-11-07 20:06:48,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46704808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:06:48, skipping insertion in model container [2024-11-07 20:06:48,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:06:48" (3/3) ... [2024-11-07 20:06:48,782 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2024-11-07 20:06:48,799 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:06:48,799 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-07 20:06:48,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:06:48,881 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;@3fd4746b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:06:48,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-11-07 20:06:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 94 states have internal predecessors, (112), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 20:06:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 20:06:48,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:48,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:48,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:48,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2087058924, now seen corresponding path program 1 times [2024-11-07 20:06:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:48,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318689807] [2024-11-07 20:06:48,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:48,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:06:49,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:49,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318689807] [2024-11-07 20:06:49,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318689807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:49,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:49,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:06:49,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44650518] [2024-11-07 20:06:49,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:49,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:06:49,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:06:49,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:49,139 INFO L87 Difference]: Start difference. First operand has 111 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 94 states have internal predecessors, (112), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:06:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:49,256 INFO L93 Difference]: Finished difference Result 199 states and 286 transitions. [2024-11-07 20:06:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:06:49,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 20:06:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:49,265 INFO L225 Difference]: With dead ends: 199 [2024-11-07 20:06:49,265 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 20:06:49,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:49,270 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 76 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:49,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 143 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:06:49,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 20:06:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-07 20:06:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 82 states have internal predecessors, (85), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 20:06:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2024-11-07 20:06:49,324 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 11 [2024-11-07 20:06:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:49,324 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2024-11-07 20:06:49,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:06:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2024-11-07 20:06:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 20:06:49,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:49,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:49,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:06:49,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:49,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash -274318795, now seen corresponding path program 1 times [2024-11-07 20:06:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:49,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289097397] [2024-11-07 20:06:49,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:06:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289097397] [2024-11-07 20:06:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289097397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:49,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:49,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:06:49,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510781119] [2024-11-07 20:06:49,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:49,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:06:49,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:49,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:06:49,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:49,357 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:06:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:49,398 INFO L93 Difference]: Finished difference Result 185 states and 228 transitions. [2024-11-07 20:06:49,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:06:49,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-07 20:06:49,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:49,401 INFO L225 Difference]: With dead ends: 185 [2024-11-07 20:06:49,401 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 20:06:49,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:49,403 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:49,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 20:06:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-07 20:06:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 82 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 20:06:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2024-11-07 20:06:49,426 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 12 [2024-11-07 20:06:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:49,427 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2024-11-07 20:06:49,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:06:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2024-11-07 20:06:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 20:06:49,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:49,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:49,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:06:49,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:49,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:49,428 INFO L85 PathProgramCache]: Analyzing trace with hash -274317129, now seen corresponding path program 1 times [2024-11-07 20:06:49,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:49,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137536993] [2024-11-07 20:06:49,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:06:49,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:49,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137536993] [2024-11-07 20:06:49,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137536993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:49,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:49,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:06:49,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402957676] [2024-11-07 20:06:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:49,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:06:49,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:49,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:06:49,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:49,470 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:06:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:49,521 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2024-11-07 20:06:49,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:06:49,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-07 20:06:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:49,525 INFO L225 Difference]: With dead ends: 99 [2024-11-07 20:06:49,525 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 20:06:49,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:49,526 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:49,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 121 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 20:06:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-07 20:06:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 77 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 20:06:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2024-11-07 20:06:49,544 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 12 [2024-11-07 20:06:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:49,544 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2024-11-07 20:06:49,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:06:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2024-11-07 20:06:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 20:06:49,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:49,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:49,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:06:49,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:49,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1625753319, now seen corresponding path program 1 times [2024-11-07 20:06:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:49,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050350907] [2024-11-07 20:06:49,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:06:49,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050350907] [2024-11-07 20:06:49,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050350907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:49,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:49,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:06:49,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371565772] [2024-11-07 20:06:49,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:49,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:06:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:49,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:06:49,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:49,631 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:06:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:49,759 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2024-11-07 20:06:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:06:49,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-07 20:06:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:49,764 INFO L225 Difference]: With dead ends: 94 [2024-11-07 20:06:49,764 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 20:06:49,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:49,765 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 44 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:49,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 175 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:06:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 20:06:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 20:06:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.290909090909091) internal successors, (71), 69 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 20:06:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2024-11-07 20:06:49,782 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 14 [2024-11-07 20:06:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:49,782 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2024-11-07 20:06:49,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:06:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2024-11-07 20:06:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:06:49,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:49,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:49,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:06:49,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:49,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1141254748, now seen corresponding path program 1 times [2024-11-07 20:06:49,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:49,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945130286] [2024-11-07 20:06:49,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:06:49,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:49,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945130286] [2024-11-07 20:06:49,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945130286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:49,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:49,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:06:49,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130159706] [2024-11-07 20:06:49,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:49,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:06:49,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:49,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:06:49,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:49,895 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:06:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:50,006 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2024-11-07 20:06:50,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:06:50,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 20:06:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:50,011 INFO L225 Difference]: With dead ends: 117 [2024-11-07 20:06:50,011 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 20:06:50,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:50,012 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 25 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:50,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 227 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:06:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 20:06:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-07 20:06:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 86 states have internal predecessors, (91), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 20:06:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 139 transitions. [2024-11-07 20:06:50,026 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 139 transitions. Word has length 15 [2024-11-07 20:06:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:50,026 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 139 transitions. [2024-11-07 20:06:50,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:06:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 139 transitions. [2024-11-07 20:06:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 20:06:50,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:50,028 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:50,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 20:06:50,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:50,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:50,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1026274879, now seen corresponding path program 1 times [2024-11-07 20:06:50,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:50,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347687860] [2024-11-07 20:06:50,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:50,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:06:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:06:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 20:06:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 20:06:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:06:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:06:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 20:06:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 20:06:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 20:06:50,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:50,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347687860] [2024-11-07 20:06:50,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347687860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:50,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376086402] [2024-11-07 20:06:50,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:50,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:50,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:50,332 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:06:50,336 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:06:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 20:06:50,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 20:06:50,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 20:06:50,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376086402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:50,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:50,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-11-07 20:06:50,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750255649] [2024-11-07 20:06:50,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:50,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 20:06:50,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:50,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 20:06:50,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-07 20:06:50,707 INFO L87 Difference]: Start difference. First operand 110 states and 139 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-11-07 20:06:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:51,329 INFO L93 Difference]: Finished difference Result 324 states and 449 transitions. [2024-11-07 20:06:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 20:06:51,330 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 71 [2024-11-07 20:06:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:51,334 INFO L225 Difference]: With dead ends: 324 [2024-11-07 20:06:51,335 INFO L226 Difference]: Without dead ends: 318 [2024-11-07 20:06:51,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-11-07 20:06:51,337 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 420 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:51,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 461 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 20:06:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-07 20:06:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 284. [2024-11-07 20:06:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 198 states have (on average 1.2272727272727273) internal successors, (243), 213 states have internal predecessors, (243), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-07 20:06:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 399 transitions. [2024-11-07 20:06:51,394 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 399 transitions. Word has length 71 [2024-11-07 20:06:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:51,395 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 399 transitions. [2024-11-07 20:06:51,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-11-07 20:06:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 399 transitions. [2024-11-07 20:06:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 20:06:51,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:51,397 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:51,415 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:06:51,601 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:06:51,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:51,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:51,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2063967983, now seen corresponding path program 1 times [2024-11-07 20:06:51,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:51,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192469367] [2024-11-07 20:06:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:51,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:06:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:06:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 20:06:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 20:06:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:06:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 20:06:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 20:06:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 20:06:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 20:06:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 20:06:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 20:06:51,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:51,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192469367] [2024-11-07 20:06:51,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192469367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:51,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:51,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:06:51,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346661334] [2024-11-07 20:06:51,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:51,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:06:51,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:51,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:06:51,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:51,736 INFO L87 Difference]: Start difference. First operand 284 states and 399 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-07 20:06:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:51,815 INFO L93 Difference]: Finished difference Result 404 states and 580 transitions. [2024-11-07 20:06:51,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:06:51,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2024-11-07 20:06:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:51,818 INFO L225 Difference]: With dead ends: 404 [2024-11-07 20:06:51,819 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 20:06:51,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:51,820 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:51,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 20:06:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-11-07 20:06:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 198 states have (on average 1.196969696969697) internal successors, (237), 213 states have internal predecessors, (237), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-07 20:06:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 393 transitions. [2024-11-07 20:06:51,849 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 393 transitions. Word has length 91 [2024-11-07 20:06:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:51,849 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 393 transitions. [2024-11-07 20:06:51,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-07 20:06:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 393 transitions. [2024-11-07 20:06:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 20:06:51,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:51,854 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:51,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 20:06:51,854 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:51,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:51,855 INFO L85 PathProgramCache]: Analyzing trace with hash 543497708, now seen corresponding path program 1 times [2024-11-07 20:06:51,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:51,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486303038] [2024-11-07 20:06:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:06:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:06:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 20:06:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 20:06:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:06:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:06:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 20:06:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 20:06:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 20:06:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 20:06:52,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:52,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486303038] [2024-11-07 20:06:52,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486303038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:52,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:52,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:06:52,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545528873] [2024-11-07 20:06:52,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:52,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:06:52,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:52,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:06:52,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:52,028 INFO L87 Difference]: Start difference. First operand 284 states and 393 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 20:06:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:52,064 INFO L93 Difference]: Finished difference Result 284 states and 393 transitions. [2024-11-07 20:06:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:06:52,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 92 [2024-11-07 20:06:52,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:52,068 INFO L225 Difference]: With dead ends: 284 [2024-11-07 20:06:52,068 INFO L226 Difference]: Without dead ends: 283 [2024-11-07 20:06:52,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:52,070 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 19 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:52,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 119 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-07 20:06:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-07 20:06:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 198 states have (on average 1.1717171717171717) internal successors, (232), 212 states have internal predecessors, (232), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-07 20:06:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 388 transitions. [2024-11-07 20:06:52,096 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 388 transitions. Word has length 92 [2024-11-07 20:06:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:52,097 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 388 transitions. [2024-11-07 20:06:52,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 20:06:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 388 transitions. [2024-11-07 20:06:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 20:06:52,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:52,101 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:52,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 20:06:52,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -331440054, now seen corresponding path program 1 times [2024-11-07 20:06:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951129631] [2024-11-07 20:06:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:06:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:06:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 20:06:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 20:06:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:06:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:06:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 20:06:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 20:06:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 20:06:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 20:06:52,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:52,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951129631] [2024-11-07 20:06:52,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951129631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:52,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:52,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:06:52,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433616376] [2024-11-07 20:06:52,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:52,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:06:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:52,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:06:52,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:52,238 INFO L87 Difference]: Start difference. First operand 283 states and 388 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 20:06:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:52,262 INFO L93 Difference]: Finished difference Result 283 states and 388 transitions. [2024-11-07 20:06:52,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:06:52,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2024-11-07 20:06:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:52,265 INFO L225 Difference]: With dead ends: 283 [2024-11-07 20:06:52,265 INFO L226 Difference]: Without dead ends: 282 [2024-11-07 20:06:52,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:52,277 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:52,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 117 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-07 20:06:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-07 20:06:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 198 states have (on average 1.1464646464646464) internal successors, (227), 211 states have internal predecessors, (227), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-07 20:06:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2024-11-07 20:06:52,311 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 383 transitions. Word has length 93 [2024-11-07 20:06:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:52,311 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 383 transitions. [2024-11-07 20:06:52,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 20:06:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 383 transitions. [2024-11-07 20:06:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 20:06:52,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:52,313 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:52,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 20:06:52,313 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:52,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:52,316 INFO L85 PathProgramCache]: Analyzing trace with hash 413013039, now seen corresponding path program 1 times [2024-11-07 20:06:52,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:52,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189122412] [2024-11-07 20:06:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:06:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:06:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 20:06:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 20:06:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:06:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:06:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 20:06:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 20:06:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 20:06:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 20:06:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 20:06:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 20:06:52,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:52,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189122412] [2024-11-07 20:06:52,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189122412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:52,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:52,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:06:52,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136778536] [2024-11-07 20:06:52,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:52,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:06:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:52,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:06:52,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:52,412 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 20:06:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:52,446 INFO L93 Difference]: Finished difference Result 378 states and 525 transitions. [2024-11-07 20:06:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:06:52,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-07 20:06:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:52,450 INFO L225 Difference]: With dead ends: 378 [2024-11-07 20:06:52,450 INFO L226 Difference]: Without dead ends: 282 [2024-11-07 20:06:52,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:52,454 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:52,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:52,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-07 20:06:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-07 20:06:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 198 states have (on average 1.121212121212121) internal successors, (222), 211 states have internal predecessors, (222), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-07 20:06:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 378 transitions. [2024-11-07 20:06:52,484 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 378 transitions. Word has length 105 [2024-11-07 20:06:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:52,484 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 378 transitions. [2024-11-07 20:06:52,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 20:06:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 378 transitions. [2024-11-07 20:06:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 20:06:52,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:52,487 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:52,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 20:06:52,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:52,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash -856240213, now seen corresponding path program 1 times [2024-11-07 20:06:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:52,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846416417] [2024-11-07 20:06:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:06:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:06:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 20:06:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 20:06:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:06:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:06:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 20:06:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 20:06:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 20:06:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 20:06:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 20:06:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 20:06:52,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:52,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846416417] [2024-11-07 20:06:52,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846416417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:52,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:52,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:06:52,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403383360] [2024-11-07 20:06:52,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:52,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:06:52,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:52,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:06:52,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:52,630 INFO L87 Difference]: Start difference. First operand 282 states and 378 transitions. Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 20:06:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:52,673 INFO L93 Difference]: Finished difference Result 343 states and 457 transitions. [2024-11-07 20:06:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:06:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-11-07 20:06:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:52,676 INFO L225 Difference]: With dead ends: 343 [2024-11-07 20:06:52,677 INFO L226 Difference]: Without dead ends: 341 [2024-11-07 20:06:52,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:52,678 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:52,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-07 20:06:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 340. [2024-11-07 20:06:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 248 states have (on average 1.1088709677419355) internal successors, (275), 260 states have internal predecessors, (275), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-07 20:06:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 447 transitions. [2024-11-07 20:06:52,718 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 447 transitions. Word has length 107 [2024-11-07 20:06:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:52,719 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 447 transitions. [2024-11-07 20:06:52,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 20:06:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 447 transitions. [2024-11-07 20:06:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 20:06:52,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:52,722 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:52,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 20:06:52,723 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:52,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1559928563, now seen corresponding path program 2 times [2024-11-07 20:06:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:52,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749788365] [2024-11-07 20:06:52,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:52,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:06:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:06:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 20:06:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 20:06:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:06:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:06:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 20:06:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 20:06:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 20:06:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 20:06:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 20:06:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 20:06:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 20:06:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 20:06:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:52,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 20:06:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:53,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 20:06:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 20:06:53,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:53,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749788365] [2024-11-07 20:06:53,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749788365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:53,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240174458] [2024-11-07 20:06:53,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 20:06:53,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:53,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:53,009 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:06:53,010 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:06:53,089 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 20:06:53,089 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:06:53,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 20:06:53,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 20:06:53,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 20:06:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240174458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:53,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-07 20:06:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895392914] [2024-11-07 20:06:53,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:53,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 20:06:53,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:53,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 20:06:53,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-07 20:06:53,557 INFO L87 Difference]: Start difference. First operand 340 states and 447 transitions. Second operand has 18 states, 17 states have (on average 6.529411764705882) internal successors, (111), 18 states have internal predecessors, (111), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2024-11-07 20:06:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:54,855 INFO L93 Difference]: Finished difference Result 790 states and 1049 transitions. [2024-11-07 20:06:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 20:06:54,856 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.529411764705882) internal successors, (111), 18 states have internal predecessors, (111), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) Word has length 135 [2024-11-07 20:06:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:54,860 INFO L225 Difference]: With dead ends: 790 [2024-11-07 20:06:54,861 INFO L226 Difference]: Without dead ends: 787 [2024-11-07 20:06:54,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2024-11-07 20:06:54,862 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 1679 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:54,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 435 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 20:06:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-07 20:06:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 767. [2024-11-07 20:06:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 563 states have (on average 1.1101243339253997) internal successors, (625), 589 states have internal predecessors, (625), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2024-11-07 20:06:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1021 transitions. [2024-11-07 20:06:54,925 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1021 transitions. Word has length 135 [2024-11-07 20:06:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:54,926 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1021 transitions. [2024-11-07 20:06:54,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.529411764705882) internal successors, (111), 18 states have internal predecessors, (111), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2024-11-07 20:06:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1021 transitions. [2024-11-07 20:06:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 20:06:54,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:54,930 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:54,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 20:06:55,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:55,137 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:55,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1985958996, now seen corresponding path program 1 times [2024-11-07 20:06:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386116970] [2024-11-07 20:06:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:06:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:06:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 20:06:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 20:06:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:06:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:06:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 20:06:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 20:06:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 20:06:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 20:06:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 20:06:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 20:06:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 20:06:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 20:06:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 20:06:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 20:06:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 20:06:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 20:06:55,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:55,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386116970] [2024-11-07 20:06:55,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386116970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:55,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424822278] [2024-11-07 20:06:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:55,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:55,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:55,297 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:06:55,299 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:06:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 20:06:55,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 20:06:55,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:06:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424822278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:55,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:06:55,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-07 20:06:55,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736734833] [2024-11-07 20:06:55,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:55,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:06:55,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:55,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:06:55,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:06:55,450 INFO L87 Difference]: Start difference. First operand 767 states and 1021 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 20:06:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:55,517 INFO L93 Difference]: Finished difference Result 768 states and 1021 transitions. [2024-11-07 20:06:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:06:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2024-11-07 20:06:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:55,523 INFO L225 Difference]: With dead ends: 768 [2024-11-07 20:06:55,523 INFO L226 Difference]: Without dead ends: 767 [2024-11-07 20:06:55,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 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:06:55,524 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:55,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 193 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-11-07 20:06:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 766. [2024-11-07 20:06:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 563 states have (on average 1.0905861456483126) internal successors, (614), 588 states have internal predecessors, (614), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2024-11-07 20:06:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1010 transitions. [2024-11-07 20:06:55,569 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1010 transitions. Word has length 149 [2024-11-07 20:06:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:55,570 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1010 transitions. [2024-11-07 20:06:55,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 20:06:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1010 transitions. [2024-11-07 20:06:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 20:06:55,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:55,573 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:55,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 20:06:55,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:55,775 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:55,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1435186532, now seen corresponding path program 1 times [2024-11-07 20:06:55,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:55,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563511822] [2024-11-07 20:06:55,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:55,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:06:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:06:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 20:06:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 20:06:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:06:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:06:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 20:06:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 20:06:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 20:06:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 20:06:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 20:06:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 20:06:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 20:06:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 20:06:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 20:06:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 20:06:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 20:06:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 20:06:55,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:55,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563511822] [2024-11-07 20:06:55,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563511822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:55,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302189327] [2024-11-07 20:06:55,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:55,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:55,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:55,905 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:06:55,916 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:06:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:55,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 20:06:55,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 20:06:56,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 20:06:56,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302189327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:56,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:56,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-07 20:06:56,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116599843] [2024-11-07 20:06:56,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:56,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 20:06:56,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:56,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 20:06:56,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:06:56,152 INFO L87 Difference]: Start difference. First operand 766 states and 1010 transitions. Second operand has 7 states, 6 states have (on average 16.166666666666668) internal successors, (97), 7 states have internal predecessors, (97), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-07 20:06:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:56,270 INFO L93 Difference]: Finished difference Result 1275 states and 1745 transitions. [2024-11-07 20:06:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:06:56,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.166666666666668) internal successors, (97), 7 states have internal predecessors, (97), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 150 [2024-11-07 20:06:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:56,278 INFO L225 Difference]: With dead ends: 1275 [2024-11-07 20:06:56,279 INFO L226 Difference]: Without dead ends: 1274 [2024-11-07 20:06:56,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:06:56,280 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 22 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:56,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 216 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:06:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-07 20:06:56,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1270. [2024-11-07 20:06:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 893 states have (on average 1.0873460246360582) internal successors, (971), 945 states have internal predecessors, (971), 372 states have call successors, (372), 1 states have call predecessors, (372), 1 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2024-11-07 20:06:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1715 transitions. [2024-11-07 20:06:56,392 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1715 transitions. Word has length 150 [2024-11-07 20:06:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:56,393 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1715 transitions. [2024-11-07 20:06:56,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.166666666666668) internal successors, (97), 7 states have internal predecessors, (97), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-07 20:06:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1715 transitions. [2024-11-07 20:06:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-07 20:06:56,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:56,399 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:56,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 20:06:56,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-07 20:06:56,600 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:56,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash 494312750, now seen corresponding path program 3 times [2024-11-07 20:06:56,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:56,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385509] [2024-11-07 20:06:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:56,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:06:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:06:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 20:06:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 20:06:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:06:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:06:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 20:06:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 20:06:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 20:06:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 20:06:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 20:06:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 20:06:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 20:06:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 20:06:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 20:06:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 20:06:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 20:06:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 20:06:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 20:06:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 20:06:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 20:06:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 20:06:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-07 20:06:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 20:06:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-07 20:06:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 20:06:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 20:06:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-07 20:06:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-07 20:06:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 20:06:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 0 proven. 624 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-07 20:06:57,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:57,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385509] [2024-11-07 20:06:57,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:57,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930410405] [2024-11-07 20:06:57,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 20:06:57,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:57,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:57,175 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:06:57,177 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:06:57,233 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-07 20:06:57,234 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:06:57,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 20:06:57,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2024-11-07 20:06:57,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 84 proven. 63 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2024-11-07 20:06:57,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930410405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:57,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:57,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 24 [2024-11-07 20:06:57,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748559255] [2024-11-07 20:06:57,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:57,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 20:06:57,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:57,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 20:06:57,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2024-11-07 20:06:57,876 INFO L87 Difference]: Start difference. First operand 1270 states and 1715 transitions. Second operand has 25 states, 24 states have (on average 6.25) internal successors, (150), 25 states have internal predecessors, (150), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2024-11-07 20:06:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:58,262 INFO L93 Difference]: Finished difference Result 1347 states and 1803 transitions. [2024-11-07 20:06:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 20:06:58,263 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.25) internal successors, (150), 25 states have internal predecessors, (150), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) Word has length 247 [2024-11-07 20:06:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:58,272 INFO L225 Difference]: With dead ends: 1347 [2024-11-07 20:06:58,272 INFO L226 Difference]: Without dead ends: 1344 [2024-11-07 20:06:58,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2024-11-07 20:06:58,274 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 234 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:58,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 218 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:06:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2024-11-07 20:06:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 143. [2024-11-07 20:06:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 103 states have (on average 1.0679611650485437) internal successors, (110), 109 states have internal predecessors, (110), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 20:06:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 186 transitions. [2024-11-07 20:06:58,347 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 186 transitions. Word has length 247 [2024-11-07 20:06:58,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:58,348 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 186 transitions. [2024-11-07 20:06:58,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.25) internal successors, (150), 25 states have internal predecessors, (150), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2024-11-07 20:06:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2024-11-07 20:06:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-07 20:06:58,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:58,351 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:58,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 20:06:58,552 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,SelfDestructingSolverStorable14 [2024-11-07 20:06:58,552 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-07 20:06:58,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:58,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2122051193, now seen corresponding path program 2 times [2024-11-07 20:06:58,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:58,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429592117] [2024-11-07 20:06:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:58,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:06:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:06:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 20:06:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 20:06:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:06:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:06:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 20:06:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 20:06:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 20:06:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 20:06:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 20:06:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 20:06:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 20:06:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 20:06:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 20:06:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 20:06:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 20:06:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 20:06:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 20:06:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 20:06:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 20:06:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 20:06:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 20:06:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 20:06:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 20:06:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 20:06:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 20:06:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-07 20:06:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-07 20:06:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-07 20:06:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-07 20:06:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-07 20:06:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 20:06:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-07 20:06:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-07 20:06:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2610 trivial. 0 not checked. [2024-11-07 20:06:58,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:58,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429592117] [2024-11-07 20:06:58,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429592117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:58,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117039885] [2024-11-07 20:06:58,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 20:06:58,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:58,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:58,860 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:06:58,862 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:06:58,959 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 20:06:58,959 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:06:58,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 20:06:58,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 20:06:59,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 20:06:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117039885] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:59,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-11-07 20:06:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550198108] [2024-11-07 20:06:59,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:59,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 20:06:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:59,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 20:06:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2024-11-07 20:06:59,373 INFO L87 Difference]: Start difference. First operand 143 states and 186 transitions. Second operand has 16 states, 15 states have (on average 14.533333333333333) internal successors, (218), 16 states have internal predecessors, (218), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2024-11-07 20:06:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:59,581 INFO L93 Difference]: Finished difference Result 173 states and 228 transitions. [2024-11-07 20:06:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 20:06:59,582 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 14.533333333333333) internal successors, (218), 16 states have internal predecessors, (218), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) Word has length 276 [2024-11-07 20:06:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:59,599 INFO L225 Difference]: With dead ends: 173 [2024-11-07 20:06:59,600 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 20:06:59,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=333, Unknown=0, NotChecked=0, Total=552 [2024-11-07 20:06:59,601 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 49 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:59,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 458 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:06:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 20:06:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 20:06:59,604 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:06:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 20:06:59,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 276 [2024-11-07 20:06:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:59,604 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 20:06:59,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 14.533333333333333) internal successors, (218), 16 states have internal predecessors, (218), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2024-11-07 20:06:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 20:06:59,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 20:06:59,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2024-11-07 20:06:59,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2024-11-07 20:06:59,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2024-11-07 20:06:59,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2024-11-07 20:06:59,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2024-11-07 20:06:59,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2024-11-07 20:06:59,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2024-11-07 20:06:59,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2024-11-07 20:06:59,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2024-11-07 20:06:59,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2024-11-07 20:06:59,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2024-11-07 20:06:59,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2024-11-07 20:06:59,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2024-11-07 20:06:59,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2024-11-07 20:06:59,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2024-11-07 20:06:59,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2024-11-07 20:06:59,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2024-11-07 20:06:59,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2024-11-07 20:06:59,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2024-11-07 20:06:59,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2024-11-07 20:06:59,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2024-11-07 20:06:59,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2024-11-07 20:06:59,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2024-11-07 20:06:59,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2024-11-07 20:06:59,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2024-11-07 20:06:59,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2024-11-07 20:06:59,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2024-11-07 20:06:59,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2024-11-07 20:06:59,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2024-11-07 20:06:59,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2024-11-07 20:06:59,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 20:06:59,813 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,SelfDestructingSolverStorable15 [2024-11-07 20:06:59,815 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:59,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 20:07:01,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 20:07:01,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:07:01 BoogieIcfgContainer [2024-11-07 20:07:01,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 20:07:01,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 20:07:01,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 20:07:01,133 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 20:07:01,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:06:48" (3/4) ... [2024-11-07 20:07:01,135 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 20:07:01,141 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-07 20:07:01,147 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-07 20:07:01,149 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 20:07:01,149 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 20:07:01,149 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 20:07:01,231 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 20:07:01,231 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 20:07:01,231 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 20:07:01,232 INFO L158 Benchmark]: Toolchain (without parser) took 13204.85ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 77.6MB in the beginning and 86.2MB in the end (delta: -8.6MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2024-11-07 20:07:01,233 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:07:01,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.48ms. Allocated memory is still 100.7MB. Free memory was 77.4MB in the beginning and 66.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:07:01,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.79ms. Allocated memory is still 100.7MB. Free memory was 66.0MB in the beginning and 64.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:07:01,233 INFO L158 Benchmark]: Boogie Preprocessor took 38.87ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 63.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:07:01,234 INFO L158 Benchmark]: RCFGBuilder took 416.87ms. Allocated memory is still 100.7MB. Free memory was 63.0MB in the beginning and 46.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 20:07:01,234 INFO L158 Benchmark]: TraceAbstraction took 12359.12ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 45.8MB in the beginning and 91.8MB in the end (delta: -46.0MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2024-11-07 20:07:01,234 INFO L158 Benchmark]: Witness Printer took 98.89ms. Allocated memory is still 234.9MB. Free memory was 91.8MB in the beginning and 86.2MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:07:01,235 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.84ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.48ms. Allocated memory is still 100.7MB. Free memory was 77.4MB in the beginning and 66.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.79ms. Allocated memory is still 100.7MB. Free memory was 66.0MB in the beginning and 64.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.87ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 63.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 416.87ms. Allocated memory is still 100.7MB. Free memory was 63.0MB in the beginning and 46.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12359.12ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 45.8MB in the beginning and 91.8MB in the end (delta: -46.0MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. * Witness Printer took 98.89ms. Allocated memory is still 234.9MB. Free memory was 91.8MB in the beginning and 86.2MB 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: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: 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 2 procedures, 111 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 16, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2773 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2663 mSDsluCounter, 3663 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2215 mSDsCounter, 1031 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1478 IncrementalHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1031 mSolverCounterUnsat, 1448 mSDtfsCounter, 1478 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2357 GetRequests, 2240 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1270occurred in iteration=14, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 1261 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2608 NumberOfCodeBlocks, 2399 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3460 ConstructedInterpolants, 0 QuantifiedInterpolants, 6287 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1504 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 19931/21466 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 30 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((urilen <= 1000000) && (0 <= ((long long) urilen + 1000000))) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 999999)) && (tokenlen <= 1000000)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((((((urilen <= 1000000) && (0 <= ((long long) urilen + 1000000))) && (1 <= c)) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 1000000)) && (c <= 2147483642)) && (tokenlen <= 1000000)) || (((((((c == 0) && (urilen <= 1000000)) && (0 <= ((long long) urilen + 1000000))) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 1000000)) && (tokenlen <= 1000000))) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-07 20:07:01,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE