./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.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/MADWiFi-encode_ie_ok.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', '0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9'] 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/MADWiFi-encode_ie_ok.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 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:06:35,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:06:35,438 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:35,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:06:35,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:06:35,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:06:35,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:06:35,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:06:35,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:06:35,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:06:35,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:06:35,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:06:35,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:06:35,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:06:35,467 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:06:35,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:06:35,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:06:35,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:06:35,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:06:35,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:06:35,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:06:35,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:06:35,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:06:35,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:06:35,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:06:35,468 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:06:35,469 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:06:35,469 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:06:35,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:06:35,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:06:35,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:06:35,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:06:35,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:06:35,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:06:35,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:06:35,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:06:35,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:06:35,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:06:35,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:06:35,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:06:35,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:06:35,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:06:35,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:06:35,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:06:35,471 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 -> 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 [2024-11-07 20:06:35,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:06:35,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:06:35,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:06:35,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:06:35,682 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:06:35,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2024-11-07 20:06:36,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:06:36,951 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:06:36,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2024-11-07 20:06:36,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be141920d/e2d567b2977244309603623a2c9b9711/FLAG50f295ff3 [2024-11-07 20:06:37,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be141920d/e2d567b2977244309603623a2c9b9711 [2024-11-07 20:06:37,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:06:37,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:06:37,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:06:37,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:06:37,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:06:37,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:06:37" (1/1) ... [2024-11-07 20:06:37,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b502d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:37, skipping insertion in model container [2024-11-07 20:06:37,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:06:37" (1/1) ... [2024-11-07 20:06:37,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:06:37,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:06:37,476 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:06:37,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:06:37,499 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:06:37,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:37 WrapperNode [2024-11-07 20:06:37,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:06:37,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:06:37,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:06:37,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:06:37,506 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:37" (1/1) ... [2024-11-07 20:06:37,511 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:37" (1/1) ... [2024-11-07 20:06:37,524 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-07 20:06:37,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:06:37,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:06:37,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:06:37,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:06:37,532 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:37" (1/1) ... [2024-11-07 20:06:37,532 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:37" (1/1) ... [2024-11-07 20:06:37,533 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:37" (1/1) ... [2024-11-07 20:06:37,539 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:37,539 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:37" (1/1) ... [2024-11-07 20:06:37,540 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:37" (1/1) ... [2024-11-07 20:06:37,541 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:37" (1/1) ... [2024-11-07 20:06:37,543 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:37" (1/1) ... [2024-11-07 20:06:37,544 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:37" (1/1) ... [2024-11-07 20:06:37,544 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:37" (1/1) ... [2024-11-07 20:06:37,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:06:37,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:06:37,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:06:37,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:06:37,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:37" (1/1) ... [2024-11-07 20:06:37,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:06:37,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:37,575 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:37,578 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:37,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:06:37,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:06:37,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:06:37,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:06:37,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 20:06:37,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 20:06:37,643 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:06:37,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:06:37,745 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-07 20:06:37,745 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:06:37,751 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:06:37,751 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 20:06:37,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:06:37 BoogieIcfgContainer [2024-11-07 20:06:37,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:06:37,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:06:37,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:06:37,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:06:37,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:06:37" (1/3) ... [2024-11-07 20:06:37,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83b9637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:06:37, skipping insertion in model container [2024-11-07 20:06:37,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:06:37" (2/3) ... [2024-11-07 20:06:37,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83b9637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:06:37, skipping insertion in model container [2024-11-07 20:06:37,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:06:37" (3/3) ... [2024-11-07 20:06:37,758 INFO L112 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2024-11-07 20:06:37,768 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:06:37,768 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-07 20:06:37,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:06:37,816 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;@e2475d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:06:37,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-07 20:06:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 32 states have (on average 1.75) internal successors, (56), 44 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:06:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 20:06:37,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:37,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:37,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:37,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash 763959634, now seen corresponding path program 1 times [2024-11-07 20:06:37,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:37,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437200421] [2024-11-07 20:06:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:37,976 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:37,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437200421] [2024-11-07 20:06:37,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437200421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:37,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:37,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:06:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73938211] [2024-11-07 20:06:37,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:37,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:06:37,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:37,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:06:37,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:37,995 INFO L87 Difference]: Start difference. First operand has 48 states, 32 states have (on average 1.75) internal successors, (56), 44 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:38,079 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2024-11-07 20:06:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:06:38,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-07 20:06:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:38,084 INFO L225 Difference]: With dead ends: 75 [2024-11-07 20:06:38,084 INFO L226 Difference]: Without dead ends: 41 [2024-11-07 20:06:38,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:38,090 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:38,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-07 20:06:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-07 20:06:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:06:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-07 20:06:38,136 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 10 [2024-11-07 20:06:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:38,136 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-07 20:06:38,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-07 20:06:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 20:06:38,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:38,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:38,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:06:38,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:38,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:38,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2087055048, now seen corresponding path program 1 times [2024-11-07 20:06:38,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:38,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418302696] [2024-11-07 20:06:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:38,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,206 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:38,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:38,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418302696] [2024-11-07 20:06:38,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418302696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:38,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:38,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:06:38,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723048601] [2024-11-07 20:06:38,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:38,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:06:38,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:38,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:06:38,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:38,209 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:38,248 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-11-07 20:06:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:06:38,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:38,249 INFO L225 Difference]: With dead ends: 41 [2024-11-07 20:06:38,249 INFO L226 Difference]: Without dead ends: 40 [2024-11-07 20:06:38,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:38,249 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:38,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 66 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-07 20:06:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-07 20:06:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:06:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-11-07 20:06:38,255 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 11 [2024-11-07 20:06:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:38,256 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-07 20:06:38,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-11-07 20:06:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 20:06:38,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:38,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:38,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:06:38,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:38,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash -274196972, now seen corresponding path program 1 times [2024-11-07 20:06:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:38,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061941023] [2024-11-07 20:06:38,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,322 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:38,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:38,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061941023] [2024-11-07 20:06:38,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061941023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:38,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:38,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:06:38,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162480589] [2024-11-07 20:06:38,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:38,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:06:38,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:38,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:06:38,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:38,323 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:38,337 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-07 20:06:38,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:06:38,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:38,339 INFO L225 Difference]: With dead ends: 40 [2024-11-07 20:06:38,339 INFO L226 Difference]: Without dead ends: 39 [2024-11-07 20:06:38,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:38,340 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:38,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-07 20:06:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-07 20:06:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:06:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-07 20:06:38,343 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 12 [2024-11-07 20:06:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:38,343 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-07 20:06:38,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-07 20:06:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 20:06:38,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:38,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:38,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:06:38,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:38,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:38,345 INFO L85 PathProgramCache]: Analyzing trace with hash 89828538, now seen corresponding path program 1 times [2024-11-07 20:06:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:38,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348511901] [2024-11-07 20:06:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,399 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:38,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:38,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348511901] [2024-11-07 20:06:38,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348511901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:38,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:38,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:06:38,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833822076] [2024-11-07 20:06:38,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:38,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:06:38,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:38,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:06:38,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:38,400 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:38,417 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-11-07 20:06:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:06:38,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-07 20:06:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:38,418 INFO L225 Difference]: With dead ends: 39 [2024-11-07 20:06:38,418 INFO L226 Difference]: Without dead ends: 38 [2024-11-07 20:06:38,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:38,419 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:38,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-07 20:06:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-07 20:06:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:06:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-07 20:06:38,421 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 13 [2024-11-07 20:06:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:38,421 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-07 20:06:38,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-07 20:06:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 20:06:38,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:38,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:38,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:06:38,422 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:38,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1510282538, now seen corresponding path program 1 times [2024-11-07 20:06:38,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:38,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411600915] [2024-11-07 20:06:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:38,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,452 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:38,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:38,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411600915] [2024-11-07 20:06:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411600915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:38,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:38,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:06:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492790245] [2024-11-07 20:06:38,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:38,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:06:38,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:38,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:06:38,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:38,455 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:38,466 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-11-07 20:06:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:06:38,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:38,467 INFO L225 Difference]: With dead ends: 38 [2024-11-07 20:06:38,467 INFO L226 Difference]: Without dead ends: 37 [2024-11-07 20:06:38,467 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:38,467 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:38,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 43 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-07 20:06:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-07 20:06:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:06:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-11-07 20:06:38,472 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 14 [2024-11-07 20:06:38,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:38,472 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-11-07 20:06:38,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-11-07 20:06:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:06:38,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:38,473 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:38,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 20:06:38,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:38,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:38,473 INFO L85 PathProgramCache]: Analyzing trace with hash 425881660, now seen corresponding path program 1 times [2024-11-07 20:06:38,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:38,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834711478] [2024-11-07 20:06:38,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:38,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,497 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:38,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:38,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834711478] [2024-11-07 20:06:38,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834711478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:38,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:38,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:06:38,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713826015] [2024-11-07 20:06:38,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:38,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:06:38,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:38,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:06:38,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:06:38,498 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:38,508 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-07 20:06:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:06:38,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:38,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:38,510 INFO L225 Difference]: With dead ends: 37 [2024-11-07 20:06:38,510 INFO L226 Difference]: Without dead ends: 36 [2024-11-07 20:06:38,510 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:38,511 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 40 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:38,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 40 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:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-07 20:06:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-07 20:06:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:06:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-07 20:06:38,515 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 15 [2024-11-07 20:06:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:38,515 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-07 20:06:38,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-07 20:06:38,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 20:06:38,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:38,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:38,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 20:06:38,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:38,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:38,516 INFO L85 PathProgramCache]: Analyzing trace with hash 575300336, now seen corresponding path program 1 times [2024-11-07 20:06:38,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:38,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168614977] [2024-11-07 20:06:38,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:38,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:06:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,584 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:38,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:38,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168614977] [2024-11-07 20:06:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168614977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:38,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:38,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:06:38,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479380652] [2024-11-07 20:06:38,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:38,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:06:38,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:38,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:06:38,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:06:38,585 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:06:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:38,623 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-07 20:06:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:06:38,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-07 20:06:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:38,624 INFO L225 Difference]: With dead ends: 36 [2024-11-07 20:06:38,625 INFO L226 Difference]: Without dead ends: 34 [2024-11-07 20:06:38,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:06:38,626 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:38,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-07 20:06:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-07 20:06:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:06:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-07 20:06:38,630 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 23 [2024-11-07 20:06:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:38,631 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-07 20:06:38,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:06:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-07 20:06:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 20:06:38,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:38,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:38,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 20:06:38,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:38,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:38,634 INFO L85 PathProgramCache]: Analyzing trace with hash 654441332, now seen corresponding path program 1 times [2024-11-07 20:06:38,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:38,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915458325] [2024-11-07 20:06:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:06:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,708 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:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915458325] [2024-11-07 20:06:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915458325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:38,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:06:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417522700] [2024-11-07 20:06:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:38,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:06:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:38,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:06:38,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:06:38,710 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:06:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:38,761 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-07 20:06:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:06:38,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-07 20:06:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:38,762 INFO L225 Difference]: With dead ends: 43 [2024-11-07 20:06:38,762 INFO L226 Difference]: Without dead ends: 41 [2024-11-07 20:06:38,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:06:38,763 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:38,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-07 20:06:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-07 20:06:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 20:06:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-07 20:06:38,768 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2024-11-07 20:06:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:38,768 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-07 20:06:38,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:06:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-07 20:06:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 20:06:38,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:38,769 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 20:06:38,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:38,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 403962922, now seen corresponding path program 1 times [2024-11-07 20:06:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752606124] [2024-11-07 20:06:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:06:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:06:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:06:38,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:38,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752606124] [2024-11-07 20:06:38,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752606124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:38,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:06:38,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:06:38,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56710206] [2024-11-07 20:06:38,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:38,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:06:38,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:38,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:06:38,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:38,826 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:06:38,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:38,841 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2024-11-07 20:06:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:06:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-07 20:06:38,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:38,842 INFO L225 Difference]: With dead ends: 46 [2024-11-07 20:06:38,842 INFO L226 Difference]: Without dead ends: 44 [2024-11-07 20:06:38,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:06:38,842 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:38,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-07 20:06:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-07 20:06:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 20:06:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2024-11-07 20:06:38,846 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 33 [2024-11-07 20:06:38,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:38,846 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2024-11-07 20:06:38,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:06:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-11-07 20:06:38,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 20:06:38,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:38,848 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:38,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 20:06:38,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:38,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash 42885982, now seen corresponding path program 1 times [2024-11-07 20:06:38,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:38,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020619696] [2024-11-07 20:06:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:06:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:06:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 20:06:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:06:38,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020619696] [2024-11-07 20:06:38,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020619696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323268201] [2024-11-07 20:06:38,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:38,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:38,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:38,967 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:38,968 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:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:39,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:06:39,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:06:39,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:06:39,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323268201] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:39,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:39,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2024-11-07 20:06:39,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50811109] [2024-11-07 20:06:39,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:39,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 20:06:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:39,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 20:06:39,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-07 20:06:39,199 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 16 states have internal predecessors, (80), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-07 20:06:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:39,345 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-11-07 20:06:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 20:06:39,346 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 16 states have internal predecessors, (80), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 42 [2024-11-07 20:06:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:39,346 INFO L225 Difference]: With dead ends: 86 [2024-11-07 20:06:39,346 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 20:06:39,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2024-11-07 20:06:39,347 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:39,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 152 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:06:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 20:06:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-07 20:06:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 65 states have internal predecessors, (72), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 20:06:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2024-11-07 20:06:39,353 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 42 [2024-11-07 20:06:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:39,353 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2024-11-07 20:06:39,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 16 states have internal predecessors, (80), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-07 20:06:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2024-11-07 20:06:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 20:06:39,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:39,354 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-07 20:06:39,366 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:39,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 20:06:39,559 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:39,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1370282880, now seen corresponding path program 1 times [2024-11-07 20:06:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:39,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348840834] [2024-11-07 20:06:39,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:39,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:06:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:39,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:06:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:39,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 20:06:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:06:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:06:39,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:39,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348840834] [2024-11-07 20:06:39,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348840834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:39,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376121024] [2024-11-07 20:06:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:39,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:39,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:39,645 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:39,646 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:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:39,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:06:39,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:06:39,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:06:39,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376121024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:06:39,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:06:39,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-07 20:06:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540206795] [2024-11-07 20:06:39,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:06:39,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:06:39,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:06:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:06:39,743 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 20:06:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:39,776 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2024-11-07 20:06:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:06:39,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2024-11-07 20:06:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:39,779 INFO L225 Difference]: With dead ends: 78 [2024-11-07 20:06:39,779 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 20:06:39,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:06:39,780 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:39,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 134 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 20:06:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-07 20:06:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.096774193548387) internal successors, (68), 64 states have internal predecessors, (68), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 20:06:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2024-11-07 20:06:39,793 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 51 [2024-11-07 20:06:39,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:39,793 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2024-11-07 20:06:39,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 20:06:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2024-11-07 20:06:39,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 20:06:39,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:39,794 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-07 20:06:39,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 20:06:39,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:39,995 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:39,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash -470903569, now seen corresponding path program 1 times [2024-11-07 20:06:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:39,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989888430] [2024-11-07 20:06:39,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:39,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:06:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:06:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 20:06:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:06:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:06:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:40,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989888430] [2024-11-07 20:06:40,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989888430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:40,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040306252] [2024-11-07 20:06:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:40,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:40,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:40,082 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:40,083 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:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:06:40,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:06:40,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:06:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040306252] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:40,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:40,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-07 20:06:40,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224818975] [2024-11-07 20:06:40,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:40,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 20:06:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:40,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 20:06:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-07 20:06:40,236 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-07 20:06:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:40,281 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2024-11-07 20:06:40,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 20:06:40,282 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 52 [2024-11-07 20:06:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:40,283 INFO L225 Difference]: With dead ends: 78 [2024-11-07 20:06:40,284 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 20:06:40,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-07 20:06:40,284 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:40,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:40,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 20:06:40,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-07 20:06:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 64 states have internal predecessors, (65), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 20:06:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-11-07 20:06:40,293 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 52 [2024-11-07 20:06:40,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:40,293 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-11-07 20:06:40,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-07 20:06:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-11-07 20:06:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 20:06:40,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:40,294 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:40,306 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:40,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:40,498 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:40,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1097745632, now seen corresponding path program 1 times [2024-11-07 20:06:40,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:40,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707734086] [2024-11-07 20:06:40,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:40,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:06:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:06:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 20:06:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:06:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 20:06:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 20:06:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 20:06:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 20:06:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 20:06:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 20:06:40,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707734086] [2024-11-07 20:06:40,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707734086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889326215] [2024-11-07 20:06:40,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:40,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:40,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:40,688 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:40,689 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:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:40,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 20:06:40,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 20:06:40,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 20:06:41,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889326215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:41,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:41,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-11-07 20:06:41,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469460061] [2024-11-07 20:06:41,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:41,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 20:06:41,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:41,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 20:06:41,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2024-11-07 20:06:41,045 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2024-11-07 20:06:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:41,213 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2024-11-07 20:06:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 20:06:41,213 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) Word has length 103 [2024-11-07 20:06:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:41,214 INFO L225 Difference]: With dead ends: 148 [2024-11-07 20:06:41,214 INFO L226 Difference]: Without dead ends: 146 [2024-11-07 20:06:41,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=576, Unknown=0, NotChecked=0, Total=870 [2024-11-07 20:06:41,215 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:41,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:06:41,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-07 20:06:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2024-11-07 20:06:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.0803571428571428) internal successors, (121), 114 states have internal predecessors, (121), 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:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2024-11-07 20:06:41,225 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 103 [2024-11-07 20:06:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:41,225 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2024-11-07 20:06:41,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2024-11-07 20:06:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2024-11-07 20:06:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 20:06:41,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:41,227 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:41,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 20:06:41,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 20:06:41,429 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:41,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1059024851, now seen corresponding path program 2 times [2024-11-07 20:06:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:41,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614343873] [2024-11-07 20:06:41,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:41,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:06:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:41,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:06:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:41,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 20:06:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:41,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:06:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:41,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 20:06:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:41,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 20:06:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:41,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 20:06:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:41,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:41,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 20:06:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:41,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 20:06:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 20:06:41,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:41,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614343873] [2024-11-07 20:06:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614343873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:41,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986863333] [2024-11-07 20:06:41,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 20:06:41,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:41,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:41,587 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:41,589 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:41,619 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 20:06:41,619 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:06:41,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 20:06:41,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-07 20:06:41,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-07 20:06:41,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986863333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:41,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:41,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 17 [2024-11-07 20:06:41,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623513784] [2024-11-07 20:06:41,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:41,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 20:06:41,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:41,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 20:06:41,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-07 20:06:41,837 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 states have internal predecessors, (115), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-07 20:06:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:41,988 INFO L93 Difference]: Finished difference Result 140 states and 169 transitions. [2024-11-07 20:06:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 20:06:41,988 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 states have internal predecessors, (115), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 106 [2024-11-07 20:06:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:41,989 INFO L225 Difference]: With dead ends: 140 [2024-11-07 20:06:41,989 INFO L226 Difference]: Without dead ends: 139 [2024-11-07 20:06:41,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2024-11-07 20:06:41,990 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:41,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 143 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:06:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-07 20:06:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-07 20:06:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 113 states have internal predecessors, (114), 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:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2024-11-07 20:06:41,998 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 106 [2024-11-07 20:06:41,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:41,998 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 162 transitions. [2024-11-07 20:06:41,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 states have internal predecessors, (115), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-07 20:06:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 162 transitions. [2024-11-07 20:06:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-07 20:06:41,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:42,000 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:42,012 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:42,203 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,SelfDestructingSolverStorable13 [2024-11-07 20:06:42,204 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:42,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash -814379774, now seen corresponding path program 2 times [2024-11-07 20:06:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:42,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651469750] [2024-11-07 20:06:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:06:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:06:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 20:06:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:06:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 20:06:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 20:06:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 20:06:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 20:06:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 20:06:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 20:06:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 20:06:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 20:06:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 20:06:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 20:06:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 20:06:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 20:06:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 20:06:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 20:06:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 20:06:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 20:06:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 20:06:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 20:06:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 594 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 20:06:42,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651469750] [2024-11-07 20:06:42,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651469750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750179937] [2024-11-07 20:06:42,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 20:06:42,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:42,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:42,598 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:42,599 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:42,683 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 20:06:42,683 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:06:42,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 20:06:42,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 594 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 20:06:42,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 594 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 20:06:43,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750179937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:43,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:43,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 45 [2024-11-07 20:06:43,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223443603] [2024-11-07 20:06:43,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:43,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-07 20:06:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:43,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-07 20:06:43,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=1237, Unknown=0, NotChecked=0, Total=2070 [2024-11-07 20:06:43,360 INFO L87 Difference]: Start difference. First operand 139 states and 162 transitions. Second operand has 46 states, 45 states have (on average 7.111111111111111) internal successors, (320), 46 states have internal predecessors, (320), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) [2024-11-07 20:06:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:43,650 INFO L93 Difference]: Finished difference Result 278 states and 353 transitions. [2024-11-07 20:06:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 20:06:43,651 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 7.111111111111111) internal successors, (320), 46 states have internal predecessors, (320), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) Word has length 222 [2024-11-07 20:06:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:43,652 INFO L225 Difference]: With dead ends: 278 [2024-11-07 20:06:43,652 INFO L226 Difference]: Without dead ends: 276 [2024-11-07 20:06:43,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1008, Invalid=1542, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 20:06:43,653 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:43,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 264 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:06:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-07 20:06:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-07 20:06:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 222 states have (on average 1.009009009009009) internal successors, (224), 223 states have internal predecessors, (224), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-07 20:06:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 326 transitions. [2024-11-07 20:06:43,667 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 326 transitions. Word has length 222 [2024-11-07 20:06:43,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:43,667 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 326 transitions. [2024-11-07 20:06:43,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 7.111111111111111) internal successors, (320), 46 states have internal predecessors, (320), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) [2024-11-07 20:06:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 326 transitions. [2024-11-07 20:06:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-11-07 20:06:43,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:43,672 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:43,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 20:06:43,872 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,SelfDestructingSolverStorable14 [2024-11-07 20:06:43,872 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:43,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1549895976, now seen corresponding path program 2 times [2024-11-07 20:06:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691342469] [2024-11-07 20:06:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:06:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:06:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 20:06:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:06:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 20:06:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 20:06:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 20:06:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 20:06:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 20:06:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 20:06:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 20:06:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 20:06:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 20:06:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 20:06:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 20:06:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 20:06:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 20:06:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 20:06:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 20:06:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 20:06:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 20:06:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 20:06:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 20:06:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-07 20:06:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 20:06:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-07 20:06:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-07 20:06:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-07 20:06:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-07 20:06:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-07 20:06:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2024-11-07 20:06:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-07 20:06:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-11-07 20:06:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-11-07 20:06:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-07 20:06:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-11-07 20:06:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-07 20:06:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-07 20:06:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-11-07 20:06:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-11-07 20:06:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2024-11-07 20:06:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-07 20:06:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2024-11-07 20:06:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-07 20:06:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2024-11-07 20:06:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-11-07 20:06:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2024-11-07 20:06:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2024-11-07 20:06:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2024-11-07 20:06:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7828 backedges. 0 proven. 2928 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-07 20:06:44,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:44,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691342469] [2024-11-07 20:06:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691342469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:44,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589353442] [2024-11-07 20:06:44,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 20:06:44,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:44,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:44,899 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:06:44,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 20:06:45,020 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 20:06:45,020 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:06:45,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 20:06:45,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7828 backedges. 0 proven. 2928 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-07 20:06:45,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7828 backedges. 0 proven. 2928 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-07 20:06:46,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589353442] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:46,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:46,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 84 [2024-11-07 20:06:46,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034018468] [2024-11-07 20:06:46,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:46,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-11-07 20:06:46,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:46,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-11-07 20:06:46,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3173, Invalid=3967, Unknown=0, NotChecked=0, Total=7140 [2024-11-07 20:06:46,827 INFO L87 Difference]: Start difference. First operand 276 states and 326 transitions. Second operand has 85 states, 84 states have (on average 7.595238095238095) internal successors, (638), 85 states have internal predecessors, (638), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) [2024-11-07 20:06:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:47,384 INFO L93 Difference]: Finished difference Result 541 states and 695 transitions. [2024-11-07 20:06:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-07 20:06:47,385 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 7.595238095238095) internal successors, (638), 85 states have internal predecessors, (638), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) Word has length 463 [2024-11-07 20:06:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:47,388 INFO L225 Difference]: With dead ends: 541 [2024-11-07 20:06:47,388 INFO L226 Difference]: Without dead ends: 539 [2024-11-07 20:06:47,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1059 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3504, Invalid=4506, Unknown=0, NotChecked=0, Total=8010 [2024-11-07 20:06:47,391 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:47,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 405 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 20:06:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-07 20:06:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2024-11-07 20:06:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 432 states have (on average 1.0046296296296295) internal successors, (434), 433 states have internal predecessors, (434), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-07 20:06:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 642 transitions. [2024-11-07 20:06:47,416 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 642 transitions. Word has length 463 [2024-11-07 20:06:47,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:47,417 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 642 transitions. [2024-11-07 20:06:47,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 7.595238095238095) internal successors, (638), 85 states have internal predecessors, (638), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) [2024-11-07 20:06:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 642 transitions. [2024-11-07 20:06:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2024-11-07 20:06:47,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:06:47,433 INFO L215 NwaCegarLoop]: trace histogram [103, 103, 103, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:47,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 20:06:47,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:47,634 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-07 20:06:47,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:06:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1301663634, now seen corresponding path program 3 times [2024-11-07 20:06:47,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:06:47,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990112552] [2024-11-07 20:06:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:06:47,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:06:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 20:06:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:06:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 20:06:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 20:06:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 20:06:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 20:06:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 20:06:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:06:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 20:06:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 20:06:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 20:06:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 20:06:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 20:06:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 20:06:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 20:06:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 20:06:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 20:06:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 20:06:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 20:06:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 20:06:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 20:06:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 20:06:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 20:06:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 20:06:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-07 20:06:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 20:06:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-07 20:06:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-07 20:06:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-07 20:06:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-07 20:06:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-07 20:06:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2024-11-07 20:06:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-07 20:06:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-11-07 20:06:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-11-07 20:06:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-07 20:06:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-11-07 20:06:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-07 20:06:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-07 20:06:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-11-07 20:06:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-11-07 20:06:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2024-11-07 20:06:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-07 20:06:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2024-11-07 20:06:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-07 20:06:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2024-11-07 20:06:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-11-07 20:06:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2024-11-07 20:06:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2024-11-07 20:06:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2024-11-07 20:06:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-11-07 20:06:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 474 [2024-11-07 20:06:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2024-11-07 20:06:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 492 [2024-11-07 20:06:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2024-11-07 20:06:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 510 [2024-11-07 20:06:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 521 [2024-11-07 20:06:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-11-07 20:06:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 539 [2024-11-07 20:06:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546 [2024-11-07 20:06:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2024-11-07 20:06:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-11-07 20:06:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2024-11-07 20:06:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 582 [2024-11-07 20:06:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 593 [2024-11-07 20:06:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2024-11-07 20:06:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 611 [2024-11-07 20:06:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 618 [2024-11-07 20:06:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 629 [2024-11-07 20:06:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2024-11-07 20:06:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-11-07 20:06:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 654 [2024-11-07 20:06:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 665 [2024-11-07 20:06:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 672 [2024-11-07 20:06:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 683 [2024-11-07 20:06:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 690 [2024-11-07 20:06:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 701 [2024-11-07 20:06:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 708 [2024-11-07 20:06:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 719 [2024-11-07 20:06:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 726 [2024-11-07 20:06:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 737 [2024-11-07 20:06:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 744 [2024-11-07 20:06:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 755 [2024-11-07 20:06:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 762 [2024-11-07 20:06:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 773 [2024-11-07 20:06:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 780 [2024-11-07 20:06:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 791 [2024-11-07 20:06:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 798 [2024-11-07 20:06:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 809 [2024-11-07 20:06:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 816 [2024-11-07 20:06:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 827 [2024-11-07 20:06:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 834 [2024-11-07 20:06:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 845 [2024-11-07 20:06:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 852 [2024-11-07 20:06:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 863 [2024-11-07 20:06:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2024-11-07 20:06:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 881 [2024-11-07 20:06:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 888 [2024-11-07 20:06:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 899 [2024-11-07 20:06:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 906 [2024-11-07 20:06:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 917 [2024-11-07 20:06:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 924 [2024-11-07 20:06:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 935 [2024-11-07 20:06:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:06:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 33966 backedges. 0 proven. 12954 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2024-11-07 20:06:50,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:06:50,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990112552] [2024-11-07 20:06:50,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990112552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:06:50,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775487805] [2024-11-07 20:06:50,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 20:06:50,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:06:50,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:06:50,506 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:06:50,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 20:06:50,589 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-07 20:06:50,589 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:06:50,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 20:06:50,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:06:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 33966 backedges. 303 proven. 457 refuted. 0 times theorem prover too weak. 33206 trivial. 0 not checked. [2024-11-07 20:06:51,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:06:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 33966 backedges. 303 proven. 457 refuted. 0 times theorem prover too weak. 33206 trivial. 0 not checked. [2024-11-07 20:06:52,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775487805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:06:52,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:06:52,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 7, 7] total 67 [2024-11-07 20:06:52,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587410887] [2024-11-07 20:06:52,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:06:52,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-07 20:06:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:06:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-07 20:06:52,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1792, Invalid=2764, Unknown=0, NotChecked=0, Total=4556 [2024-11-07 20:06:52,024 INFO L87 Difference]: Start difference. First operand 539 states and 642 transitions. Second operand has 68 states, 67 states have (on average 7.2835820895522385) internal successors, (488), 68 states have internal predecessors, (488), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) [2024-11-07 20:06:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:06:52,176 INFO L93 Difference]: Finished difference Result 539 states and 642 transitions. [2024-11-07 20:06:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 20:06:52,177 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 7.2835820895522385) internal successors, (488), 68 states have internal predecessors, (488), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) Word has length 942 [2024-11-07 20:06:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:06:52,179 INFO L225 Difference]: With dead ends: 539 [2024-11-07 20:06:52,179 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 20:06:52,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2153 GetRequests, 2078 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2241, Invalid=3459, Unknown=0, NotChecked=0, Total=5700 [2024-11-07 20:06:52,182 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:06:52,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 174 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:06:52,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 20:06:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 20:06:52,182 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:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 20:06:52,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 942 [2024-11-07 20:06:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:06:52,183 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 20:06:52,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 7.2835820895522385) internal successors, (488), 68 states have internal predecessors, (488), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) [2024-11-07 20:06:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 20:06:52,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 20:06:52,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-11-07 20:06:52,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-11-07 20:06:52,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-11-07 20:06:52,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-11-07 20:06:52,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-11-07 20:06:52,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-11-07 20:06:52,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-11-07 20:06:52,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-11-07 20:06:52,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-11-07 20:06:52,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-11-07 20:06:52,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-11-07 20:06:52,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-11-07 20:06:52,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 20:06:52,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 20:06:52,389 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:06:52,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 20:06:53,005 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 20:06:53,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:06:53 BoogieIcfgContainer [2024-11-07 20:06:53,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 20:06:53,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 20:06:53,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 20:06:53,021 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 20:06:53,021 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:37" (3/4) ... [2024-11-07 20:06:53,023 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 20:06:53,026 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-07 20:06:53,030 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-07 20:06:53,030 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 20:06:53,030 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 20:06:53,030 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 20:06:53,087 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 20:06:53,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 20:06:53,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 20:06:53,089 INFO L158 Benchmark]: Toolchain (without parser) took 15733.07ms. Allocated memory was 117.4MB in the beginning and 570.4MB in the end (delta: 453.0MB). Free memory was 91.8MB in the beginning and 286.4MB in the end (delta: -194.6MB). Peak memory consumption was 258.0MB. Max. memory is 16.1GB. [2024-11-07 20:06:53,089 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:06:53,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.71ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 80.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:06:53,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.67ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:06:53,090 INFO L158 Benchmark]: Boogie Preprocessor took 19.38ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:06:53,091 INFO L158 Benchmark]: RCFGBuilder took 205.92ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 66.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:06:53,091 INFO L158 Benchmark]: TraceAbstraction took 15267.45ms. Allocated memory was 117.4MB in the beginning and 570.4MB in the end (delta: 453.0MB). Free memory was 66.0MB in the beginning and 294.5MB in the end (delta: -228.5MB). Peak memory consumption was 312.3MB. Max. memory is 16.1GB. [2024-11-07 20:06:53,092 INFO L158 Benchmark]: Witness Printer took 67.85ms. Allocated memory is still 570.4MB. Free memory was 294.5MB in the beginning and 286.4MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:06:53,095 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.75ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.71ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 80.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.67ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.38ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 205.92ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 66.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15267.45ms. Allocated memory was 117.4MB in the beginning and 570.4MB in the end (delta: 453.0MB). Free memory was 66.0MB in the beginning and 294.5MB in the end (delta: -228.5MB). Peak memory consumption was 312.3MB. Max. memory is 16.1GB. * Witness Printer took 67.85ms. Allocated memory is still 570.4MB. Free memory was 294.5MB in the beginning and 286.4MB in the end (delta: 8.1MB). 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: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: 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: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: 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, 48 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 17, TraceHistogramMax: 103, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 2269 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1783 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1580 IncrementalHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 486 mSDtfsCounter, 1580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4530 GetRequests, 4206 SyntacticMatches, 1 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4626 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=539occurred in iteration=16, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 4117 NumberOfCodeBlocks, 3149 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6015 ConstructedInterpolants, 0 QuantifiedInterpolants, 13050 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1938 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 32 InterpolantComputations, 10 PerfectInterpolantSequences, 107143/132064 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 12 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((1 <= p) && (i == 0)) && (((long long) p + bufsize) <= 999999)) && (bufsize_0 <= 999999)) && (p <= 999999)) && (ielen <= 999999)) && (1 <= ielen)) || ((((((((1 <= p) && (1 <= i)) && (i <= 2147483646)) && (bufsize <= 999999)) && (bufsize_0 <= 999999)) && (p <= 999999)) && (ielen <= 999999)) && (1 <= ielen))) - 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:06:53,115 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