./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench/cohencu.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f 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/cohencu.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 97975d1d0cca27fb3b198cb58b8a28ecc801f4371efebfb415ca164ff6598233 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:55:55,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:55:55,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:55:55,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:55:55,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:55:55,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:55:55,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:55:55,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:55:55,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:55:55,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:55:55,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:55:55,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:55:55,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:55:55,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:55:55,543 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:55:55,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:55:55,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:55:55,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:55:55,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:55:55,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:55:55,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:55:55,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:55:55,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:55:55,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:55:55,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:55:55,549 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:55:55,549 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:55:55,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:55:55,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:55:55,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:55:55,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:55:55,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:55:55,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:55:55,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:55:55,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:55:55,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:55:55,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:55:55,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:55:55,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:55:55,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:55:55,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:55:55,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:55:55,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:55:55,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:55:55,555 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 -> 97975d1d0cca27fb3b198cb58b8a28ecc801f4371efebfb415ca164ff6598233 [2024-11-10 18:55:55,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:55:55,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:55:55,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:55:55,862 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:55:55,865 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:55:55,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/cohencu.c [2024-11-10 18:55:57,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:55:57,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:55:57,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu.c [2024-11-10 18:55:57,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c162282de/d1eb8f50e49745fcbee2d7aa42e5f213/FLAGec822d7f4 [2024-11-10 18:55:57,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c162282de/d1eb8f50e49745fcbee2d7aa42e5f213 [2024-11-10 18:55:57,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:55:57,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:55:57,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:55:57,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:55:57,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:55:57,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679f8638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57, skipping insertion in model container [2024-11-10 18:55:57,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:55:57,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:55:57,697 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:55:57,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:55:57,733 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:55:57,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57 WrapperNode [2024-11-10 18:55:57,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:55:57,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:55:57,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:55:57,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:55:57,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,798 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 188 [2024-11-10 18:55:57,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:55:57,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:55:57,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:55:57,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:55:57,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,839 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-10 18:55:57,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:55:57,849 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:55:57,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:55:57,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:55:57,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (1/1) ... [2024-11-10 18:55:57,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:55:57,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:55:57,895 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-10 18:55:57,901 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-10 18:55:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:55:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:55:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:55:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:55:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 18:55:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 18:55:58,032 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:55:58,034 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:55:58,895 INFO L? ?]: Removed 237 outVars from TransFormulas that were not future-live. [2024-11-10 18:55:58,895 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:55:58,924 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:55:58,924 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:55:58,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:55:58 BoogieIcfgContainer [2024-11-10 18:55:58,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:55:58,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:55:58,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:55:58,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:55:58,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:55:57" (1/3) ... [2024-11-10 18:55:58,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550ee4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:55:58, skipping insertion in model container [2024-11-10 18:55:58,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:57" (2/3) ... [2024-11-10 18:55:58,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550ee4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:55:58, skipping insertion in model container [2024-11-10 18:55:58,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:55:58" (3/3) ... [2024-11-10 18:55:58,936 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu.c [2024-11-10 18:55:58,951 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:55:58,951 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2024-11-10 18:55:59,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:55:59,031 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;@3aff1be7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:55:59,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2024-11-10 18:55:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 155 states have (on average 1.9161290322580644) internal successors, (297), 293 states have internal predecessors, (297), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 18:55:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 18:55:59,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:55:59,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 18:55:59,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-10 18:55:59,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:55:59,050 INFO L85 PathProgramCache]: Analyzing trace with hash 10188357, now seen corresponding path program 1 times [2024-11-10 18:55:59,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:55:59,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966956292] [2024-11-10 18:55:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:55:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:55:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:55:59,178 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-10 18:55:59,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:55:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966956292] [2024-11-10 18:55:59,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966956292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:55:59,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:55:59,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:55:59,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213623333] [2024-11-10 18:55:59,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:55:59,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:55:59,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:55:59,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:55:59,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:55:59,220 INFO L87 Difference]: Start difference. First operand has 306 states, 155 states have (on average 1.9161290322580644) internal successors, (297), 293 states have internal predecessors, (297), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-10 18:55:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:55:59,277 INFO L93 Difference]: Finished difference Result 602 states and 646 transitions. [2024-11-10 18:55:59,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:55:59,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-11-10 18:55:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:55:59,287 INFO L225 Difference]: With dead ends: 602 [2024-11-10 18:55:59,287 INFO L226 Difference]: Without dead ends: 292 [2024-11-10 18:55:59,291 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-10 18:55:59,294 INFO L432 NwaCegarLoop]: 308 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, 308 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-10 18:55:59,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:55:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-10 18:55:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-11-10 18:55:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 150 states have (on average 1.8733333333333333) internal successors, (281), 280 states have internal predecessors, (281), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 18:55:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 301 transitions. [2024-11-10 18:55:59,345 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 301 transitions. Word has length 4 [2024-11-10 18:55:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:55:59,346 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 301 transitions. [2024-11-10 18:55:59,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-10 18:55:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 301 transitions. [2024-11-10 18:55:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 18:55:59,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:55:59,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 18:55:59,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:55:59,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-10 18:55:59,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:55:59,348 INFO L85 PathProgramCache]: Analyzing trace with hash 315842152, now seen corresponding path program 1 times [2024-11-10 18:55:59,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:55:59,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116252754] [2024-11-10 18:55:59,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:55:59,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:55:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:55:59,415 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-10 18:55:59,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:55:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116252754] [2024-11-10 18:55:59,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116252754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:55:59,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:55:59,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:55:59,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546580110] [2024-11-10 18:55:59,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:55:59,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:55:59,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:55:59,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:55:59,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:55:59,421 INFO L87 Difference]: Start difference. First operand 292 states and 301 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-10 18:55:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:55:59,613 INFO L93 Difference]: Finished difference Result 563 states and 582 transitions. [2024-11-10 18:55:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:55:59,614 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-10 18:55:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:55:59,617 INFO L225 Difference]: With dead ends: 563 [2024-11-10 18:55:59,617 INFO L226 Difference]: Without dead ends: 543 [2024-11-10 18:55:59,621 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-10 18:55:59,622 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 238 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:55:59,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 527 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:55:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-10 18:55:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 352. [2024-11-10 18:55:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 205 states have (on average 1.775609756097561) internal successors, (364), 335 states have internal predecessors, (364), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 18:55:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 394 transitions. [2024-11-10 18:55:59,652 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 394 transitions. Word has length 5 [2024-11-10 18:55:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:55:59,653 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 394 transitions. [2024-11-10 18:55:59,653 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-10 18:55:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 394 transitions. [2024-11-10 18:55:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 18:55:59,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:55:59,654 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 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-10 18:55:59,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:55:59,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-10 18:55:59,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:55:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash 791043463, now seen corresponding path program 1 times [2024-11-10 18:55:59,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:55:59,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965542460] [2024-11-10 18:55:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:55:59,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:55:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:55:59,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [248396052] [2024-11-10 18:55:59,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:55:59,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:55:59,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:55:59,716 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-10 18:55:59,721 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-10 18:55:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:55:59,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:55:59,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:56:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:56:00,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:56:00,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:56:00,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965542460] [2024-11-10 18:56:00,028 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 18:56:00,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248396052] [2024-11-10 18:56:00,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248396052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:56:00,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:56:00,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:56:00,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416593384] [2024-11-10 18:56:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:56:00,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:56:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:56:00,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:56:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:56:00,034 INFO L87 Difference]: Start difference. First operand 352 states and 394 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:56:00,503 INFO L93 Difference]: Finished difference Result 515 states and 572 transitions. [2024-11-10 18:56:00,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:56:00,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-10 18:56:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:56:00,507 INFO L225 Difference]: With dead ends: 515 [2024-11-10 18:56:00,507 INFO L226 Difference]: Without dead ends: 460 [2024-11-10 18:56:00,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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-10 18:56:00,509 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 137 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 18:56:00,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 271 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 18:56:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-10 18:56:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 439. [2024-11-10 18:56:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 287 states have (on average 1.6341463414634145) internal successors, (469), 417 states have internal predecessors, (469), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 18:56:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 509 transitions. [2024-11-10 18:56:00,532 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 509 transitions. Word has length 38 [2024-11-10 18:56:00,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:56:00,532 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 509 transitions. [2024-11-10 18:56:00,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 509 transitions. [2024-11-10 18:56:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 18:56:00,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:56:00,534 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-10 18:56:00,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:56:00,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:56:00,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-10 18:56:00,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:56:00,736 INFO L85 PathProgramCache]: Analyzing trace with hash -16436315, now seen corresponding path program 1 times [2024-11-10 18:56:00,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:56:00,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35866205] [2024-11-10 18:56:00,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:56:00,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:56:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:00,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 18:56:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 18:56:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:56:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:56:00,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:56:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35866205] [2024-11-10 18:56:00,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35866205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:56:00,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:56:00,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:56:00,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702567690] [2024-11-10 18:56:00,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:56:00,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:56:00,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:56:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:56:00,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:56:00,888 INFO L87 Difference]: Start difference. First operand 439 states and 509 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:56:01,299 INFO L93 Difference]: Finished difference Result 472 states and 516 transitions. [2024-11-10 18:56:01,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:56:01,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-10 18:56:01,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:56:01,302 INFO L225 Difference]: With dead ends: 472 [2024-11-10 18:56:01,303 INFO L226 Difference]: Without dead ends: 449 [2024-11-10 18:56:01,304 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-10 18:56:01,306 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 122 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 18:56:01,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 432 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 18:56:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-10 18:56:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2024-11-10 18:56:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 287 states have (on average 1.5540069686411149) internal successors, (446), 417 states have internal predecessors, (446), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 18:56:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 486 transitions. [2024-11-10 18:56:01,323 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 486 transitions. Word has length 40 [2024-11-10 18:56:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:56:01,323 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 486 transitions. [2024-11-10 18:56:01,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 486 transitions. [2024-11-10 18:56:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 18:56:01,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:56:01,326 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 18:56:01,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:56:01,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-10 18:56:01,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:56:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1384577475, now seen corresponding path program 1 times [2024-11-10 18:56:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:56:01,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84432396] [2024-11-10 18:56:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:56:01,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:56:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:01,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 18:56:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:01,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 18:56:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:01,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:56:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:56:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:56:01,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84432396] [2024-11-10 18:56:01,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84432396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:56:01,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:56:01,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:56:01,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855397630] [2024-11-10 18:56:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:56:01,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:56:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:56:01,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:56:01,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:56:01,463 INFO L87 Difference]: Start difference. First operand 439 states and 486 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:56:02,964 INFO L93 Difference]: Finished difference Result 451 states and 493 transitions. [2024-11-10 18:56:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:56:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-10 18:56:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:56:02,966 INFO L225 Difference]: With dead ends: 451 [2024-11-10 18:56:02,967 INFO L226 Difference]: Without dead ends: 449 [2024-11-10 18:56:02,967 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-10 18:56:02,968 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 140 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 18:56:02,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 455 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 18:56:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-10 18:56:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2024-11-10 18:56:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 287 states have (on average 1.5470383275261324) internal successors, (444), 417 states have internal predecessors, (444), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 18:56:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 484 transitions. [2024-11-10 18:56:02,980 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 484 transitions. Word has length 42 [2024-11-10 18:56:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:56:02,981 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 484 transitions. [2024-11-10 18:56:02,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 484 transitions. [2024-11-10 18:56:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 18:56:02,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:56:02,984 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 18:56:02,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:56:02,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-10 18:56:02,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:56:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash -27771020, now seen corresponding path program 1 times [2024-11-10 18:56:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:56:02,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942808233] [2024-11-10 18:56:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:56:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:56:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:03,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 18:56:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 18:56:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:03,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:56:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:56:03,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:56:03,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942808233] [2024-11-10 18:56:03,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942808233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:56:03,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:56:03,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:56:03,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739540913] [2024-11-10 18:56:03,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:56:03,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:56:03,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:56:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:56:03,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:56:03,191 INFO L87 Difference]: Start difference. First operand 439 states and 484 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:56:04,043 INFO L93 Difference]: Finished difference Result 451 states and 491 transitions. [2024-11-10 18:56:04,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:56:04,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-10 18:56:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:56:04,046 INFO L225 Difference]: With dead ends: 451 [2024-11-10 18:56:04,046 INFO L226 Difference]: Without dead ends: 449 [2024-11-10 18:56:04,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:56:04,048 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 257 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 18:56:04,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 376 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 18:56:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-10 18:56:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2024-11-10 18:56:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 287 states have (on average 1.5400696864111498) internal successors, (442), 417 states have internal predecessors, (442), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 18:56:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 482 transitions. [2024-11-10 18:56:04,061 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 482 transitions. Word has length 43 [2024-11-10 18:56:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:56:04,061 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 482 transitions. [2024-11-10 18:56:04,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 482 transitions. [2024-11-10 18:56:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 18:56:04,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:56:04,062 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 18:56:04,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:56:04,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-10 18:56:04,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:56:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1602442751, now seen corresponding path program 1 times [2024-11-10 18:56:04,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:56:04,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313298149] [2024-11-10 18:56:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:56:04,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:56:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:56:04,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121905746] [2024-11-10 18:56:04,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:56:04,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:56:04,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:56:04,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:56:04,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:56:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:04,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:56:04,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:56:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:56:04,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:56:04,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:56:04,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313298149] [2024-11-10 18:56:04,350 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 18:56:04,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121905746] [2024-11-10 18:56:04,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121905746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:56:04,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:56:04,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:56:04,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720444561] [2024-11-10 18:56:04,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:56:04,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:56:04,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:56:04,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:56:04,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:56:04,352 INFO L87 Difference]: Start difference. First operand 439 states and 482 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:04,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:56:04,848 INFO L93 Difference]: Finished difference Result 456 states and 489 transitions. [2024-11-10 18:56:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:56:04,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-10 18:56:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:56:04,851 INFO L225 Difference]: With dead ends: 456 [2024-11-10 18:56:04,851 INFO L226 Difference]: Without dead ends: 447 [2024-11-10 18:56:04,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-10 18:56:04,852 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 114 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 18:56:04,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 262 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 18:56:04,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-10 18:56:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 442. [2024-11-10 18:56:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 290 states have (on average 1.513793103448276) internal successors, (439), 420 states have internal predecessors, (439), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 18:56:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 479 transitions. [2024-11-10 18:56:04,869 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 479 transitions. Word has length 46 [2024-11-10 18:56:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:56:04,869 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 479 transitions. [2024-11-10 18:56:04,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 479 transitions. [2024-11-10 18:56:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 18:56:04,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:56:04,872 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 18:56:04,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 18:56:05,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 18:56:05,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-10 18:56:05,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:56:05,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1863882064, now seen corresponding path program 1 times [2024-11-10 18:56:05,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:56:05,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388179226] [2024-11-10 18:56:05,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:56:05,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:56:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:05,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 18:56:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:05,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 18:56:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:05,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:56:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:56:05,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:56:05,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388179226] [2024-11-10 18:56:05,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388179226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:56:05,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:56:05,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:56:05,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654964834] [2024-11-10 18:56:05,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:56:05,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:56:05,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:56:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:56:05,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:56:05,212 INFO L87 Difference]: Start difference. First operand 442 states and 479 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:56:05,975 INFO L93 Difference]: Finished difference Result 455 states and 480 transitions. [2024-11-10 18:56:05,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:56:05,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-10 18:56:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:56:05,982 INFO L225 Difference]: With dead ends: 455 [2024-11-10 18:56:05,982 INFO L226 Difference]: Without dead ends: 449 [2024-11-10 18:56:05,982 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-10 18:56:05,982 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 136 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 18:56:05,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 392 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 18:56:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-10 18:56:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 442. [2024-11-10 18:56:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 290 states have (on average 1.493103448275862) internal successors, (433), 420 states have internal predecessors, (433), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 18:56:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 473 transitions. [2024-11-10 18:56:05,996 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 473 transitions. Word has length 47 [2024-11-10 18:56:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:56:05,997 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 473 transitions. [2024-11-10 18:56:05,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 473 transitions. [2024-11-10 18:56:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 18:56:05,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:56:05,998 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 18:56:05,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:56:05,999 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-10 18:56:05,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:56:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1523395092, now seen corresponding path program 1 times [2024-11-10 18:56:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:56:05,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965954079] [2024-11-10 18:56:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:56:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:56:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:06,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 18:56:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:06,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 18:56:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:06,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:56:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:56:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:56:06,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:56:06,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965954079] [2024-11-10 18:56:06,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965954079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:56:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:56:06,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:56:06,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982213569] [2024-11-10 18:56:06,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:56:06,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:56:06,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:56:06,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:56:06,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:56:06,127 INFO L87 Difference]: Start difference. First operand 442 states and 473 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:56:06,659 INFO L93 Difference]: Finished difference Result 453 states and 474 transitions. [2024-11-10 18:56:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:56:06,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-11-10 18:56:06,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:56:06,661 INFO L225 Difference]: With dead ends: 453 [2024-11-10 18:56:06,662 INFO L226 Difference]: Without dead ends: 380 [2024-11-10 18:56:06,662 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-10 18:56:06,663 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 230 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 18:56:06,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 274 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 18:56:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-10 18:56:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2024-11-10 18:56:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 227 states have (on average 1.60352422907489) internal successors, (364), 357 states have internal predecessors, (364), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 18:56:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 398 transitions. [2024-11-10 18:56:06,674 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 398 transitions. Word has length 51 [2024-11-10 18:56:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:56:06,674 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 398 transitions. [2024-11-10 18:56:06,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:56:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 398 transitions. [2024-11-10 18:56:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 18:56:06,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:56:06,676 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 18:56:06,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:56:06,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-10 18:56:06,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:56:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1905399693, now seen corresponding path program 1 times [2024-11-10 18:56:06,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:56:06,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400716685] [2024-11-10 18:56:06,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:56:06,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:56:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:56:06,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869778104] [2024-11-10 18:56:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:56:06,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:56:06,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:56:06,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:56:06,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 18:56:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:56:06,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:56:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:56:06,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:56:06,815 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:56:06,816 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 138 remaining) [2024-11-10 18:56:06,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 138 remaining) [2024-11-10 18:56:06,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 138 remaining) [2024-11-10 18:56:06,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 138 remaining) [2024-11-10 18:56:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 138 remaining) [2024-11-10 18:56:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 138 remaining) [2024-11-10 18:56:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 138 remaining) [2024-11-10 18:56:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 138 remaining) [2024-11-10 18:56:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 138 remaining) [2024-11-10 18:56:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 138 remaining) [2024-11-10 18:56:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 138 remaining) [2024-11-10 18:56:06,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 138 remaining) [2024-11-10 18:56:06,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 138 remaining) [2024-11-10 18:56:06,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 138 remaining) [2024-11-10 18:56:06,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 138 remaining) [2024-11-10 18:56:06,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 138 remaining) [2024-11-10 18:56:06,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 138 remaining) [2024-11-10 18:56:06,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 138 remaining) [2024-11-10 18:56:06,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 138 remaining) [2024-11-10 18:56:06,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 138 remaining) [2024-11-10 18:56:06,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 138 remaining) [2024-11-10 18:56:06,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 138 remaining) [2024-11-10 18:56:06,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 138 remaining) [2024-11-10 18:56:06,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 138 remaining) [2024-11-10 18:56:06,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 138 remaining) [2024-11-10 18:56:06,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 138 remaining) [2024-11-10 18:56:06,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 138 remaining) [2024-11-10 18:56:06,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 138 remaining) [2024-11-10 18:56:06,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 138 remaining) [2024-11-10 18:56:06,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 138 remaining) [2024-11-10 18:56:06,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 138 remaining) [2024-11-10 18:56:06,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 138 remaining) [2024-11-10 18:56:06,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 138 remaining) [2024-11-10 18:56:06,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 138 remaining) [2024-11-10 18:56:06,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 138 remaining) [2024-11-10 18:56:06,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 138 remaining) [2024-11-10 18:56:06,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 138 remaining) [2024-11-10 18:56:06,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 138 remaining) [2024-11-10 18:56:06,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 138 remaining) [2024-11-10 18:56:06,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 138 remaining) [2024-11-10 18:56:06,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 138 remaining) [2024-11-10 18:56:06,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 138 remaining) [2024-11-10 18:56:06,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 138 remaining) [2024-11-10 18:56:06,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 138 remaining) [2024-11-10 18:56:06,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 138 remaining) [2024-11-10 18:56:06,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 138 remaining) [2024-11-10 18:56:06,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 138 remaining) [2024-11-10 18:56:06,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 138 remaining) [2024-11-10 18:56:06,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 138 remaining) [2024-11-10 18:56:06,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 138 remaining) [2024-11-10 18:56:06,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 138 remaining) [2024-11-10 18:56:06,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 138 remaining) [2024-11-10 18:56:06,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 138 remaining) [2024-11-10 18:56:06,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 138 remaining) [2024-11-10 18:56:06,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 138 remaining) [2024-11-10 18:56:06,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 138 remaining) [2024-11-10 18:56:06,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 138 remaining) [2024-11-10 18:56:06,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 138 remaining) [2024-11-10 18:56:06,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 138 remaining) [2024-11-10 18:56:06,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 138 remaining) [2024-11-10 18:56:06,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 138 remaining) [2024-11-10 18:56:06,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 138 remaining) [2024-11-10 18:56:06,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 138 remaining) [2024-11-10 18:56:06,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 138 remaining) [2024-11-10 18:56:06,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 138 remaining) [2024-11-10 18:56:06,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 138 remaining) [2024-11-10 18:56:06,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 138 remaining) [2024-11-10 18:56:06,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 138 remaining) [2024-11-10 18:56:06,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 138 remaining) [2024-11-10 18:56:06,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 138 remaining) [2024-11-10 18:56:06,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 138 remaining) [2024-11-10 18:56:06,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 138 remaining) [2024-11-10 18:56:06,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 138 remaining) [2024-11-10 18:56:06,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 138 remaining) [2024-11-10 18:56:06,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 138 remaining) [2024-11-10 18:56:06,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 138 remaining) [2024-11-10 18:56:06,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 138 remaining) [2024-11-10 18:56:06,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 138 remaining) [2024-11-10 18:56:06,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 138 remaining) [2024-11-10 18:56:06,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 138 remaining) [2024-11-10 18:56:06,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 138 remaining) [2024-11-10 18:56:06,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 138 remaining) [2024-11-10 18:56:06,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 138 remaining) [2024-11-10 18:56:06,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 138 remaining) [2024-11-10 18:56:06,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 138 remaining) [2024-11-10 18:56:06,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 138 remaining) [2024-11-10 18:56:06,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 138 remaining) [2024-11-10 18:56:06,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 138 remaining) [2024-11-10 18:56:06,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 138 remaining) [2024-11-10 18:56:06,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 138 remaining) [2024-11-10 18:56:06,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 138 remaining) [2024-11-10 18:56:06,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 138 remaining) [2024-11-10 18:56:06,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 138 remaining) [2024-11-10 18:56:06,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 138 remaining) [2024-11-10 18:56:06,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 138 remaining) [2024-11-10 18:56:06,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 138 remaining) [2024-11-10 18:56:06,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 138 remaining) [2024-11-10 18:56:06,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 138 remaining) [2024-11-10 18:56:06,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 138 remaining) [2024-11-10 18:56:06,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 138 remaining) [2024-11-10 18:56:06,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 138 remaining) [2024-11-10 18:56:06,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 138 remaining) [2024-11-10 18:56:06,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 138 remaining) [2024-11-10 18:56:06,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 18:56:07,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:56:07,052 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:56:07,094 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:56:07,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:56:07 BoogieIcfgContainer [2024-11-10 18:56:07,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:56:07,099 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:56:07,099 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:56:07,099 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:56:07,100 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:55:58" (3/4) ... [2024-11-10 18:56:07,102 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 18:56:07,155 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:56:07,155 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:56:07,156 INFO L158 Benchmark]: Toolchain (without parser) took 9681.25ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 121.2MB in the beginning and 167.2MB in the end (delta: -46.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:56:07,158 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 100.7MB. Free memory was 64.8MB in the beginning and 64.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:56:07,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.11ms. Allocated memory is still 174.1MB. Free memory was 121.2MB in the beginning and 108.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 18:56:07,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.17ms. Allocated memory is still 174.1MB. Free memory was 108.0MB in the beginning and 105.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:56:07,159 INFO L158 Benchmark]: Boogie Preprocessor took 46.38ms. Allocated memory is still 174.1MB. Free memory was 105.6MB in the beginning and 103.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:56:07,159 INFO L158 Benchmark]: IcfgBuilder took 1075.42ms. Allocated memory is still 174.1MB. Free memory was 103.7MB in the beginning and 107.9MB in the end (delta: -4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 18:56:07,159 INFO L158 Benchmark]: TraceAbstraction took 8169.95ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 106.9MB in the beginning and 170.4MB in the end (delta: -63.5MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB. [2024-11-10 18:56:07,160 INFO L158 Benchmark]: Witness Printer took 56.30ms. Allocated memory is still 209.7MB. Free memory was 169.3MB in the beginning and 167.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:56:07,161 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99ms. Allocated memory is still 100.7MB. Free memory was 64.8MB in the beginning and 64.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.11ms. Allocated memory is still 174.1MB. Free memory was 121.2MB in the beginning and 108.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.17ms. Allocated memory is still 174.1MB. Free memory was 108.0MB in the beginning and 105.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.38ms. Allocated memory is still 174.1MB. Free memory was 105.6MB in the beginning and 103.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1075.42ms. Allocated memory is still 174.1MB. Free memory was 103.7MB in the beginning and 107.9MB in the end (delta: -4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8169.95ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 106.9MB in the beginning and 170.4MB in the end (delta: -63.5MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB. * Witness Printer took 56.30ms. Allocated memory is still 209.7MB. Free memory was 169.3MB in the beginning and 167.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 46]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int a, n, x, y, z; [L24] a = __VERIFIER_nondet_int() [L25] n = 0 [L26] x = 0 [L27] y = 1 [L28] z = 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L30] COND TRUE 1 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L31] EXPR 6 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L31] EXPR 6 * n + 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L31] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L31] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n * n + 3 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n * n + 3 * n + 1 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L32] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L33] EXPR n * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L33] EXPR n * n * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L33] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L33] RET __VERIFIER_assert(x == n * n * n) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR 18*x VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x - 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR 2*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x - 12*y + 2*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x - 12*y + 2*z - 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L34] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR z*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR (z*z) - 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR 6*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR (z*z) - 12*y - 6*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR (z*z) - 12*y - 6*z + 12 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L35] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L36] COND TRUE !(n <= a) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L45] EXPR 6*n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L45] EXPR 6*n + 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L45] CALL __VERIFIER_assert(z == 6*n + 6) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L45] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L46] 6*a VAL [n=0, x=0, y=1, z=6] - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 306 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1442 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1374 mSDsluCounter, 3297 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1418 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2421 IncrementalHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 1879 mSDtfsCounter, 2421 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=442occurred in iteration=7, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 258 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 1522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 166 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 84/84 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 18:56:07,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)