./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c', '-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', 'aa3033c827040052fc2b3f2ac84da9b892249c5596676af10298d2e88bf55166'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c -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 aa3033c827040052fc2b3f2ac84da9b892249c5596676af10298d2e88bf55166 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:50:47,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:50:47,373 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:50:47,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:50:47,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:50:47,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:50:47,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:50:47,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:50:47,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:50:47,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:50:47,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:50:47,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:50:47,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:50:47,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:50:47,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:50:47,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:50:47,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:50:47,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:50:47,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:50:47,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:50:47,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:50:47,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:50:47,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:50:47,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:50:47,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:50:47,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:50:47,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:50:47,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:50:47,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:50:47,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:50:47,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:50:47,416 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 -> aa3033c827040052fc2b3f2ac84da9b892249c5596676af10298d2e88bf55166 [2024-11-07 20:50:47,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:50:47,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:50:47,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:50:47,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:50:47,694 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:50:47,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c [2024-11-07 20:50:48,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:50:49,193 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:50:49,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c [2024-11-07 20:50:49,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8347d8d9e/1b212c4185b44fd4a849a6985ea0fd2d/FLAG58b970525 [2024-11-07 20:50:49,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8347d8d9e/1b212c4185b44fd4a849a6985ea0fd2d [2024-11-07 20:50:49,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:50:49,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:50:49,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:50:49,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:50:49,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:50:49,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29725048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49, skipping insertion in model container [2024-11-07 20:50:49,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:50:49,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:50:49,405 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:50:49,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:50:49,447 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:50:49,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49 WrapperNode [2024-11-07 20:50:49,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:50:49,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:50:49,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:50:49,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:50:49,455 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:50:49" (1/1) ... [2024-11-07 20:50:49,462 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:50:49" (1/1) ... [2024-11-07 20:50:49,495 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-11-07 20:50:49,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:50:49,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:50:49,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:50:49,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:50:49,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,526 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:50:49,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:50:49,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:50:49,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:50:49,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:50:49,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49" (1/1) ... [2024-11-07 20:50:49,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:50:49,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:50:49,584 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:50:49,591 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:50:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:50:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 20:50:49,611 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 20:50:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:50:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:50:49,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:50:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 20:50:49,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 20:50:49,665 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:50:49,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:50:50,292 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-07 20:50:50,292 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:50:50,316 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:50:50,317 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 20:50:50,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:50:50 BoogieIcfgContainer [2024-11-07 20:50:50,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:50:50,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:50:50,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:50:50,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:50:50,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:50:49" (1/3) ... [2024-11-07 20:50:50,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c1f7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:50:50, skipping insertion in model container [2024-11-07 20:50:50,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:50:49" (2/3) ... [2024-11-07 20:50:50,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c1f7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:50:50, skipping insertion in model container [2024-11-07 20:50:50,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:50:50" (3/3) ... [2024-11-07 20:50:50,326 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound50.c [2024-11-07 20:50:50,339 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:50:50,339 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 102 error locations. [2024-11-07 20:50:50,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:50:50,408 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;@3cd6187a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:50:50,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2024-11-07 20:50:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 118 states have (on average 1.9067796610169492) internal successors, (225), 220 states have internal predecessors, (225), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 20:50:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:50:50,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:50:50,418 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:50:50,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-07 20:50:50,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:50:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1300544064, now seen corresponding path program 1 times [2024-11-07 20:50:50,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:50:50,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992524421] [2024-11-07 20:50:50,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:50:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:50,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:50:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:50:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:50,548 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:50:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:50:50,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992524421] [2024-11-07 20:50:50,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992524421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:50:50,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:50:50,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:50:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796196485] [2024-11-07 20:50:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:50:50,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 20:50:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:50:50,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 20:50:50,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 20:50:50,573 INFO L87 Difference]: Start difference. First operand has 228 states, 118 states have (on average 1.9067796610169492) internal successors, (225), 220 states have internal predecessors, (225), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:50:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:50:50,601 INFO L93 Difference]: Finished difference Result 427 states and 470 transitions. [2024-11-07 20:50:50,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 20:50:50,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-07 20:50:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:50:50,608 INFO L225 Difference]: With dead ends: 427 [2024-11-07 20:50:50,608 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 20:50:50,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 20:50:50,616 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:50:50,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:50:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 20:50:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-07 20:50:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 113 states have (on average 1.6814159292035398) internal successors, (190), 189 states have internal predecessors, (190), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 20:50:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2024-11-07 20:50:50,672 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 15 [2024-11-07 20:50:50,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:50:50,673 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2024-11-07 20:50:50,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:50:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2024-11-07 20:50:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:50:50,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:50:50,674 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:50:50,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:50:50,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-07 20:50:50,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:50:50,678 INFO L85 PathProgramCache]: Analyzing trace with hash -542225025, now seen corresponding path program 1 times [2024-11-07 20:50:50,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:50:50,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045637992] [2024-11-07 20:50:50,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:50,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:50:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:50,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:50:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:50:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:50,778 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:50:50,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:50:50,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045637992] [2024-11-07 20:50:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045637992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:50:50,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:50:50,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:50:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652705726] [2024-11-07 20:50:50,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:50:50,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:50:50,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:50:50,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:50:50,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:50:50,782 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:50:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:50:51,224 INFO L93 Difference]: Finished difference Result 357 states and 365 transitions. [2024-11-07 20:50:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:50:51,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-11-07 20:50:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:50:51,226 INFO L225 Difference]: With dead ends: 357 [2024-11-07 20:50:51,226 INFO L226 Difference]: Without dead ends: 293 [2024-11-07 20:50:51,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:50:51,228 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 20:50:51,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 139 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 20:50:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-07 20:50:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2024-11-07 20:50:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 203 states have (on average 1.4285714285714286) internal successors, (290), 279 states have internal predecessors, (290), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 20:50:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 300 transitions. [2024-11-07 20:50:51,243 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 300 transitions. Word has length 15 [2024-11-07 20:50:51,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:50:51,245 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 300 transitions. [2024-11-07 20:50:51,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:50:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 300 transitions. [2024-11-07 20:50:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 20:50:51,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:50:51,246 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:50:51,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:50:51,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-07 20:50:51,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:50:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash 16941157, now seen corresponding path program 1 times [2024-11-07 20:50:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:50:51,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578262623] [2024-11-07 20:50:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:50:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:50:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:50:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:51,379 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:50:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:50:51,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578262623] [2024-11-07 20:50:51,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578262623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:50:51,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:50:51,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:50:51,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123677454] [2024-11-07 20:50:51,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:50:51,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:50:51,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:50:51,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:50:51,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:50:51,381 INFO L87 Difference]: Start difference. First operand 287 states and 300 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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:50:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:50:51,446 INFO L93 Difference]: Finished difference Result 311 states and 318 transitions. [2024-11-07 20:50:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:50:51,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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 53 [2024-11-07 20:50:51,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:50:51,449 INFO L225 Difference]: With dead ends: 311 [2024-11-07 20:50:51,449 INFO L226 Difference]: Without dead ends: 304 [2024-11-07 20:50:51,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:50:51,450 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 68 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:50:51,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 361 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:50:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-07 20:50:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 286. [2024-11-07 20:50:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 202 states have (on average 1.400990099009901) internal successors, (283), 278 states have internal predecessors, (283), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 20:50:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 293 transitions. [2024-11-07 20:50:51,478 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 293 transitions. Word has length 53 [2024-11-07 20:50:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:50:51,479 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 293 transitions. [2024-11-07 20:50:51,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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:50:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 293 transitions. [2024-11-07 20:50:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 20:50:51,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:50:51,482 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:50:51,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:50:51,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-07 20:50:51,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:50:51,483 INFO L85 PathProgramCache]: Analyzing trace with hash -899413337, now seen corresponding path program 1 times [2024-11-07 20:50:51,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:50:51,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981385534] [2024-11-07 20:50:51,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:51,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:50:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:51,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:50:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:50:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:51,662 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:50:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:50:51,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981385534] [2024-11-07 20:50:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981385534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:50:51,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:50:51,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:50:51,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038192237] [2024-11-07 20:50:51,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:50:51,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:50:51,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:50:51,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:50:51,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:50:51,667 INFO L87 Difference]: Start difference. First operand 286 states and 293 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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:50:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:50:51,872 INFO L93 Difference]: Finished difference Result 306 states and 311 transitions. [2024-11-07 20:50:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:50:51,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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 55 [2024-11-07 20:50:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:50:51,874 INFO L225 Difference]: With dead ends: 306 [2024-11-07 20:50:51,874 INFO L226 Difference]: Without dead ends: 263 [2024-11-07 20:50:51,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:50:51,875 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 151 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:50:51,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 286 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:50:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-07 20:50:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 245. [2024-11-07 20:50:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 237 states have internal predecessors, (240), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 20:50:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 250 transitions. [2024-11-07 20:50:51,885 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 250 transitions. Word has length 55 [2024-11-07 20:50:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:50:51,885 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 250 transitions. [2024-11-07 20:50:51,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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:50:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 250 transitions. [2024-11-07 20:50:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 20:50:51,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:50:51,887 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:50:51,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:50:51,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-07 20:50:51,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:50:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash -551914376, now seen corresponding path program 1 times [2024-11-07 20:50:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:50:51,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37383035] [2024-11-07 20:50:51,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:51,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:50:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:52,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:50:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:52,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:50:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:52,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 20:50:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:52,031 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:50:52,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:50:52,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37383035] [2024-11-07 20:50:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37383035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:50:52,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:50:52,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:50:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965049281] [2024-11-07 20:50:52,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:50:52,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:50:52,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:50:52,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:50:52,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:50:52,035 INFO L87 Difference]: Start difference. First operand 245 states and 250 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:50:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:50:52,056 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2024-11-07 20:50:52,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:50:52,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2024-11-07 20:50:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:50:52,059 INFO L225 Difference]: With dead ends: 247 [2024-11-07 20:50:52,059 INFO L226 Difference]: Without dead ends: 245 [2024-11-07 20:50:52,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:50:52,060 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:50:52,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:50:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-07 20:50:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-07 20:50:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 161 states have (on average 1.4782608695652173) internal successors, (238), 237 states have internal predecessors, (238), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 20:50:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 248 transitions. [2024-11-07 20:50:52,075 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 248 transitions. Word has length 63 [2024-11-07 20:50:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:50:52,077 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 248 transitions. [2024-11-07 20:50:52,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:50:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 248 transitions. [2024-11-07 20:50:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 20:50:52,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:50:52,081 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:50:52,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 20:50:52,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-07 20:50:52,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:50:52,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1206783254, now seen corresponding path program 1 times [2024-11-07 20:50:52,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:50:52,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498466159] [2024-11-07 20:50:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:52,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:50:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:50:52,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338646076] [2024-11-07 20:50:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:52,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:50:52,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:50:52,121 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:50:52,123 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:50:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:52,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:50:52,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:50:52,329 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:50:52,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:50:52,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:50:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498466159] [2024-11-07 20:50:52,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:50:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338646076] [2024-11-07 20:50:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338646076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:50:52,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:50:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:50:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476441049] [2024-11-07 20:50:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:50:52,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:50:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:50:52,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:50:52,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:50:52,334 INFO L87 Difference]: Start difference. First operand 245 states and 248 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:50:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:50:52,826 INFO L93 Difference]: Finished difference Result 420 states and 433 transitions. [2024-11-07 20:50:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:50:52,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2024-11-07 20:50:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:50:52,828 INFO L225 Difference]: With dead ends: 420 [2024-11-07 20:50:52,828 INFO L226 Difference]: Without dead ends: 355 [2024-11-07 20:50:52,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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:50:52,829 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 20:50:52,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 162 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 20:50:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-07 20:50:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 349. [2024-11-07 20:50:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 263 states have (on average 1.3460076045627376) internal successors, (354), 339 states have internal predecessors, (354), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:50:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 368 transitions. [2024-11-07 20:50:52,840 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 368 transitions. Word has length 68 [2024-11-07 20:50:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:50:52,841 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 368 transitions. [2024-11-07 20:50:52,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:50:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 368 transitions. [2024-11-07 20:50:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 20:50:52,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:50:52,842 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:50:52,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 20:50:53,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:50:53,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-07 20:50:53,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:50:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1968525308, now seen corresponding path program 1 times [2024-11-07 20:50:53,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:50:53,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250946885] [2024-11-07 20:50:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:53,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:50:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:53,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:50:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:50:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:53,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 20:50:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:53,147 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:50:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:50:53,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250946885] [2024-11-07 20:50:53,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250946885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:50:53,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:50:53,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:50:53,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163376043] [2024-11-07 20:50:53,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:50:53,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:50:53,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:50:53,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:50:53,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:50:53,149 INFO L87 Difference]: Start difference. First operand 349 states and 368 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:50:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:50:53,263 INFO L93 Difference]: Finished difference Result 350 states and 368 transitions. [2024-11-07 20:50:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:50:53,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 75 [2024-11-07 20:50:53,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:50:53,266 INFO L225 Difference]: With dead ends: 350 [2024-11-07 20:50:53,266 INFO L226 Difference]: Without dead ends: 349 [2024-11-07 20:50:53,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:50:53,267 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 55 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:50:53,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 319 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:50:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-07 20:50:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-07 20:50:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 263 states have (on average 1.3422053231939164) internal successors, (353), 339 states have internal predecessors, (353), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:50:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 367 transitions. [2024-11-07 20:50:53,281 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 367 transitions. Word has length 75 [2024-11-07 20:50:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:50:53,281 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 367 transitions. [2024-11-07 20:50:53,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:50:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 367 transitions. [2024-11-07 20:50:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 20:50:53,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:50:53,283 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:50:53,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 20:50:53,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-07 20:50:53,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:50:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash -894742242, now seen corresponding path program 1 times [2024-11-07 20:50:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:50:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447173620] [2024-11-07 20:50:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:50:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:53,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:50:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:53,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:50:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:53,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 20:50:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:53,397 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:50:53,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:50:53,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447173620] [2024-11-07 20:50:53,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447173620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:50:53,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:50:53,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:50:53,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946370379] [2024-11-07 20:50:53,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:50:53,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:50:53,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:50:53,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:50:53,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:50:53,398 INFO L87 Difference]: Start difference. First operand 349 states and 367 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:50:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:50:53,728 INFO L93 Difference]: Finished difference Result 350 states and 367 transitions. [2024-11-07 20:50:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:50:53,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 76 [2024-11-07 20:50:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:50:53,731 INFO L225 Difference]: With dead ends: 350 [2024-11-07 20:50:53,731 INFO L226 Difference]: Without dead ends: 349 [2024-11-07 20:50:53,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:50:53,732 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 47 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:50:53,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 350 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:50:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-07 20:50:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-07 20:50:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 263 states have (on average 1.338403041825095) internal successors, (352), 339 states have internal predecessors, (352), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:50:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 366 transitions. [2024-11-07 20:50:53,741 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 366 transitions. Word has length 76 [2024-11-07 20:50:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:50:53,741 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 366 transitions. [2024-11-07 20:50:53,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:50:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 366 transitions. [2024-11-07 20:50:53,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 20:50:53,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:50:53,742 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:50:53,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 20:50:53,742 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-07 20:50:53,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:50:53,743 INFO L85 PathProgramCache]: Analyzing trace with hash 358119750, now seen corresponding path program 1 times [2024-11-07 20:50:53,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:50:53,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19021805] [2024-11-07 20:50:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:53,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:50:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:50:53,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762308728] [2024-11-07 20:50:53,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:53,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:50:53,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:50:53,771 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:50:53,772 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:50:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:53,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 20:50:53,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:50:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:50:54,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:50:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:50:54,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:50:54,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19021805] [2024-11-07 20:50:54,415 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:50:54,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762308728] [2024-11-07 20:50:54,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762308728] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:50:54,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 20:50:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-07 20:50:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853913766] [2024-11-07 20:50:54,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 20:50:54,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 20:50:54,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:50:54,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 20:50:54,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:50:54,418 INFO L87 Difference]: Start difference. First operand 349 states and 366 transitions. Second operand has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 20:50:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:50:55,564 INFO L93 Difference]: Finished difference Result 373 states and 384 transitions. [2024-11-07 20:50:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 20:50:55,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 116 [2024-11-07 20:50:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:50:55,566 INFO L225 Difference]: With dead ends: 373 [2024-11-07 20:50:55,566 INFO L226 Difference]: Without dead ends: 364 [2024-11-07 20:50:55,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-07 20:50:55,567 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 342 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:50:55,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 201 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 20:50:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-07 20:50:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 353. [2024-11-07 20:50:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 270 states have (on average 1.3074074074074074) internal successors, (353), 343 states have internal predecessors, (353), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:50:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 367 transitions. [2024-11-07 20:50:55,578 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 367 transitions. Word has length 116 [2024-11-07 20:50:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:50:55,578 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 367 transitions. [2024-11-07 20:50:55,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 20:50:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2024-11-07 20:50:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 20:50:55,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:50:55,580 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:50:55,596 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:50:55,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:50:55,781 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-07 20:50:55,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:50:55,781 INFO L85 PathProgramCache]: Analyzing trace with hash 555700040, now seen corresponding path program 1 times [2024-11-07 20:50:55,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:50:55,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913262881] [2024-11-07 20:50:55,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:55,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:50:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:50:55,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160189221] [2024-11-07 20:50:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:50:55,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:50:55,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:50:55,822 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:50:55,824 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:50:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:50:55,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 20:50:55,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:50:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:50:56,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:50:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:50:57,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:50:57,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913262881] [2024-11-07 20:50:57,451 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:50:57,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160189221] [2024-11-07 20:50:57,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160189221] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:50:57,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 20:50:57,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2024-11-07 20:50:57,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043155790] [2024-11-07 20:50:57,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 20:50:57,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 20:50:57,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:50:57,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 20:50:57,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:50:57,453 INFO L87 Difference]: Start difference. First operand 353 states and 367 transitions. Second operand has 9 states, 8 states have (on average 26.25) internal successors, (210), 9 states have internal predecessors, (210), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 20:51:05,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.95s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:51:10,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:51:15,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:51:25,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:51:30,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:51:34,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:51:35,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:51:38,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:51:41,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:51:46,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:51:50,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:51:58,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.96s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:52:02,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:52:07,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:52:11,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:52:18,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:52:24,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:52:26,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:52:27,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:52:33,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []