./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench/dijkstra.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench/dijkstra.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 8c2c25cf461f08df93633b3a41b472f1ef6c33d9d6e519054ad0fbe6ddfed0fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:26:38,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:26:38,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:26:38,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:26:38,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:26:38,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:26:38,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:26:38,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:26:38,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:26:38,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:26:38,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:26:38,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:26:38,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:26:38,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:26:38,804 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:26:38,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:26:38,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:26:38,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:26:38,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:26:38,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:26:38,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:26:38,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:26:38,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:26:38,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:26:38,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:26:38,810 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:26:38,810 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:26:38,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:26:38,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:26:38,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:26:38,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:26:38,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:26:38,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:26:38,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:26:38,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:26:38,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:26:38,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:26:38,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:26:38,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:26:38,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:26:38,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:26:38,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:26:38,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:26:38,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:26:38,815 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 8c2c25cf461f08df93633b3a41b472f1ef6c33d9d6e519054ad0fbe6ddfed0fc [2024-11-19 10:26:39,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:26:39,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:26:39,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:26:39,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:26:39,168 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:26:39,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/dijkstra.c [2024-11-19 10:26:40,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:26:40,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:26:40,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/dijkstra.c [2024-11-19 10:26:40,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d726ebba/bdedd0ab85e640339d8608ab185a5c84/FLAG93c5cbf1f [2024-11-19 10:26:40,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d726ebba/bdedd0ab85e640339d8608ab185a5c84 [2024-11-19 10:26:40,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:26:40,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:26:40,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:26:40,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:26:40,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:26:40,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:26:40" (1/1) ... [2024-11-19 10:26:40,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a68808f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:40, skipping insertion in model container [2024-11-19 10:26:40,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:26:40" (1/1) ... [2024-11-19 10:26:40,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:26:41,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:26:41,054 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:26:41,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:26:41,096 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:26:41,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41 WrapperNode [2024-11-19 10:26:41,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:26:41,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:26:41,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:26:41,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:26:41,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,162 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 316 [2024-11-19 10:26:41,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:26:41,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:26:41,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:26:41,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:26:41,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,217 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-19 10:26:41,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:26:41,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:26:41,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:26:41,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:26:41,254 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (1/1) ... [2024-11-19 10:26:41,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:26:41,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:26:41,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:26:41,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:26:41,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:26:41,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:26:41,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:26:41,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:26:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 10:26:41,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 10:26:41,409 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:26:41,411 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:26:48,782 INFO L? ?]: Removed 585 outVars from TransFormulas that were not future-live. [2024-11-19 10:26:48,783 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:26:48,823 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:26:48,823 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:26:48,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:26:48 BoogieIcfgContainer [2024-11-19 10:26:48,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:26:48,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:26:48,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:26:48,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:26:48,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:26:40" (1/3) ... [2024-11-19 10:26:48,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e77f3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:26:48, skipping insertion in model container [2024-11-19 10:26:48,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:26:41" (2/3) ... [2024-11-19 10:26:48,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e77f3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:26:48, skipping insertion in model container [2024-11-19 10:26:48,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:26:48" (3/3) ... [2024-11-19 10:26:48,835 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra.c [2024-11-19 10:26:48,852 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:26:48,852 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 258 error locations. [2024-11-19 10:26:48,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:26:48,941 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;@552b9687, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:26:48,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 258 error locations. [2024-11-19 10:26:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 542 states, 273 states have (on average 1.9743589743589745) internal successors, (539), 531 states have internal predecessors, (539), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 10:26:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 10:26:48,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:26:48,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 10:26:48,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr188ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2024-11-19 10:26:48,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:26:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash 28723381, now seen corresponding path program 1 times [2024-11-19 10:26:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:26:48,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651742052] [2024-11-19 10:26:48,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:26:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:26:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:26:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:26:49,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:26:49,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651742052] [2024-11-19 10:26:49,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651742052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:26:49,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:26:49,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:26:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695605194] [2024-11-19 10:26:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:26:49,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 10:26:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:26:49,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 10:26:49,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:26:49,136 INFO L87 Difference]: Start difference. First operand has 542 states, 273 states have (on average 1.9743589743589745) internal successors, (539), 531 states have internal predecessors, (539), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:26:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:26:49,198 INFO L93 Difference]: Finished difference Result 1063 states and 1111 transitions. [2024-11-19 10:26:49,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 10:26:49,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 10:26:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:26:49,211 INFO L225 Difference]: With dead ends: 1063 [2024-11-19 10:26:49,212 INFO L226 Difference]: Without dead ends: 523 [2024-11-19 10:26:49,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-19 10:26:49,222 INFO L432 NwaCegarLoop]: 539 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, 539 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-19 10:26:49,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:26:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-19 10:26:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2024-11-19 10:26:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 268 states have (on average 1.9253731343283582) internal successors, (516), 513 states have internal predecessors, (516), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:26:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 532 transitions. [2024-11-19 10:26:49,303 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 532 transitions. Word has length 5 [2024-11-19 10:26:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:26:49,305 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 532 transitions. [2024-11-19 10:26:49,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:26:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 532 transitions. [2024-11-19 10:26:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 10:26:49,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:26:49,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 10:26:49,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:26:49,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2024-11-19 10:26:49,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:26:49,307 INFO L85 PathProgramCache]: Analyzing trace with hash 28699817, now seen corresponding path program 1 times [2024-11-19 10:26:49,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:26:49,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003123029] [2024-11-19 10:26:49,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:26:49,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:26:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:26:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:26:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:26:49,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003123029] [2024-11-19 10:26:49,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003123029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:26:49,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:26:49,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:26:49,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812180025] [2024-11-19 10:26:49,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:26:49,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:26:49,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:26:49,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:26:49,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:26:49,375 INFO L87 Difference]: Start difference. First operand 523 states and 532 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:26:50,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:26:52,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:26:56,399 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-19 10:26:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:26:56,850 INFO L93 Difference]: Finished difference Result 1288 states and 1420 transitions. [2024-11-19 10:26:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:26:56,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 10:26:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:26:56,862 INFO L225 Difference]: With dead ends: 1288 [2024-11-19 10:26:56,866 INFO L226 Difference]: Without dead ends: 771 [2024-11-19 10:26:56,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:26:56,868 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 239 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-19 10:26:56,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 613 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 449 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2024-11-19 10:26:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-11-19 10:26:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 711. [2024-11-19 10:26:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 450 states have (on average 1.9133333333333333) internal successors, (861), 695 states have internal predecessors, (861), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 10:26:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 889 transitions. [2024-11-19 10:26:56,916 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 889 transitions. Word has length 5 [2024-11-19 10:26:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:26:56,916 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 889 transitions. [2024-11-19 10:26:56,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:26:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 889 transitions. [2024-11-19 10:26:56,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 10:26:56,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:26:56,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 10:26:56,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:26:56,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2024-11-19 10:26:56,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:26:56,921 INFO L85 PathProgramCache]: Analyzing trace with hash 889692871, now seen corresponding path program 1 times [2024-11-19 10:26:56,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:26:56,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844729876] [2024-11-19 10:26:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:26:56,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:26:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:26:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:26:56,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:26:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844729876] [2024-11-19 10:26:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844729876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:26:56,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:26:56,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:26:56,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093455854] [2024-11-19 10:26:56,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:26:56,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:26:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:26:56,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:26:56,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:26:56,964 INFO L87 Difference]: Start difference. First operand 711 states and 889 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:27:01,230 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-19 10:27:05,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:27:09,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:27:13,386 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-19 10:27:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:27:15,289 INFO L93 Difference]: Finished difference Result 1146 states and 1405 transitions. [2024-11-19 10:27:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:27:15,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 10:27:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:27:15,297 INFO L225 Difference]: With dead ends: 1146 [2024-11-19 10:27:15,297 INFO L226 Difference]: Without dead ends: 1085 [2024-11-19 10:27:15,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:27:15,301 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 369 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 61 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:27:15,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 582 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 474 Invalid, 4 Unknown, 0 Unchecked, 18.3s Time] [2024-11-19 10:27:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2024-11-19 10:27:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 970. [2024-11-19 10:27:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 701 states have (on average 1.7788873038516406) internal successors, (1247), 946 states have internal predecessors, (1247), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 10:27:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1291 transitions. [2024-11-19 10:27:15,347 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1291 transitions. Word has length 6 [2024-11-19 10:27:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:27:15,347 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1291 transitions. [2024-11-19 10:27:15,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:27:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1291 transitions. [2024-11-19 10:27:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:27:15,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:27:15,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:27:15,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:27:15,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2024-11-19 10:27:15,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:27:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash 296359209, now seen corresponding path program 1 times [2024-11-19 10:27:15,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:27:15,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570303895] [2024-11-19 10:27:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:27:15,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:27:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:27:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:27:15,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:27:15,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570303895] [2024-11-19 10:27:15,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570303895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:27:15,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:27:15,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:27:15,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146731706] [2024-11-19 10:27:15,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:27:15,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:27:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:27:15,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:27:15,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:27:15,440 INFO L87 Difference]: Start difference. First operand 970 states and 1291 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:27:19,691 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-19 10:27:23,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:27:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:27:25,347 INFO L93 Difference]: Finished difference Result 1008 states and 1291 transitions. [2024-11-19 10:27:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:27:25,348 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 10:27:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:27:25,351 INFO L225 Difference]: With dead ends: 1008 [2024-11-19 10:27:25,352 INFO L226 Difference]: Without dead ends: 1006 [2024-11-19 10:27:25,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:27:25,353 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 212 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-19 10:27:25,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 472 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 591 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2024-11-19 10:27:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2024-11-19 10:27:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 970. [2024-11-19 10:27:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 701 states have (on average 1.776034236804565) internal successors, (1245), 946 states have internal predecessors, (1245), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 10:27:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1289 transitions. [2024-11-19 10:27:25,376 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1289 transitions. Word has length 8 [2024-11-19 10:27:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:27:25,377 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1289 transitions. [2024-11-19 10:27:25,378 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:27:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1289 transitions. [2024-11-19 10:27:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:27:25,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:27:25,379 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-19 10:27:25,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:27:25,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2024-11-19 10:27:25,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:27:25,380 INFO L85 PathProgramCache]: Analyzing trace with hash 642042466, now seen corresponding path program 1 times [2024-11-19 10:27:25,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:27:25,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506687225] [2024-11-19 10:27:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:27:25,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:27:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:27:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:27:25,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:27:25,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506687225] [2024-11-19 10:27:25,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506687225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:27:25,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372160584] [2024-11-19 10:27:25,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:27:25,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:27:25,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:27:25,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:27:25,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:27:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:27:25,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:27:25,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:27:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:27:25,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:27:25,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372160584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:27:25,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:27:25,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-19 10:27:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612815975] [2024-11-19 10:27:25,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:27:25,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:27:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:27:25,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:27:25,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:27:25,568 INFO L87 Difference]: Start difference. First operand 970 states and 1289 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:27:29,762 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-19 10:27:34,766 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-19 10:27:38,792 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-19 10:27:42,958 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-19 10:27:46,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:27:51,734 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-19 10:27:55,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:27:59,829 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-19 10:28:04,148 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-19 10:28:08,599 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-19 10:28:12,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:28:17,958 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-19 10:28:19,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []