./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.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 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 20:35:22,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 20:35:22,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 20:35:22,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 20:35:22,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 20:35:22,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 20:35:22,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 20:35:22,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 20:35:22,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 20:35:22,671 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 20:35:22,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 20:35:22,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 20:35:22,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 20:35:22,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 20:35:22,673 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 20:35:22,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 20:35:22,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 20:35:22,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 20:35:22,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 20:35:22,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 20:35:22,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 20:35:22,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 20:35:22,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 20:35:22,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 20:35:22,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 20:35:22,679 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 20:35:22,680 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 20:35:22,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 20:35:22,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 20:35:22,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 20:35:22,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 20:35:22,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 20:35:22,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 20:35:22,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 20:35:22,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:35:22,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 20:35:22,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 20:35:22,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 20:35:22,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 20:35:22,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 20:35:22,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 20:35:22,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 20:35:22,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 20:35:22,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 20:35:22,685 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 -> 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc [2024-10-24 20:35:22,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 20:35:22,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 20:35:22,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 20:35:22,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 20:35:22,948 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 20:35:22,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2024-10-24 20:35:24,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 20:35:24,573 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 20:35:24,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2024-10-24 20:35:24,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a0aa49a/a5f6489da53a45b4a588e87b7ec88339/FLAG89c1ab884 [2024-10-24 20:35:24,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a0aa49a/a5f6489da53a45b4a588e87b7ec88339 [2024-10-24 20:35:24,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 20:35:24,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 20:35:24,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 20:35:24,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 20:35:24,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 20:35:24,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:24,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7d6728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24, skipping insertion in model container [2024-10-24 20:35:24,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:24,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 20:35:24,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:35:24,831 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 20:35:24,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:35:24,877 INFO L204 MainTranslator]: Completed translation [2024-10-24 20:35:24,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24 WrapperNode [2024-10-24 20:35:24,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 20:35:24,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 20:35:24,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 20:35:24,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 20:35:24,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:24,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:24,950 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2024-10-24 20:35:24,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 20:35:24,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 20:35:24,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 20:35:24,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 20:35:24,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:24,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:24,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:25,001 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-10-24 20:35:25,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:25,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:25,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:25,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:25,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:25,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:25,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 20:35:25,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 20:35:25,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 20:35:25,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 20:35:25,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (1/1) ... [2024-10-24 20:35:25,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:35:25,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:35:25,063 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-10-24 20:35:25,066 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-10-24 20:35:25,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 20:35:25,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 20:35:25,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 20:35:25,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 20:35:25,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 20:35:25,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 20:35:25,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 20:35:25,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 20:35:25,162 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 20:35:25,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 20:35:25,610 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-24 20:35:25,610 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 20:35:25,634 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 20:35:25,636 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 20:35:25,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:35:25 BoogieIcfgContainer [2024-10-24 20:35:25,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 20:35:25,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 20:35:25,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 20:35:25,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 20:35:25,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:35:24" (1/3) ... [2024-10-24 20:35:25,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de88976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:35:25, skipping insertion in model container [2024-10-24 20:35:25,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:35:24" (2/3) ... [2024-10-24 20:35:25,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de88976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:35:25, skipping insertion in model container [2024-10-24 20:35:25,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:35:25" (3/3) ... [2024-10-24 20:35:25,646 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound10.c [2024-10-24 20:35:25,662 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 20:35:25,662 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2024-10-24 20:35:25,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 20:35:25,731 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;@4725d666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 20:35:25,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2024-10-24 20:35:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 95 states have (on average 1.936842105263158) internal successors, (184), 179 states have internal predecessors, (184), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:35:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 20:35:25,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:35:25,740 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:35:25,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:35:25,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:35:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1162004414, now seen corresponding path program 1 times [2024-10-24 20:35:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:35:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209752117] [2024-10-24 20:35:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:35:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:35:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:35:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:25,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:35:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209752117] [2024-10-24 20:35:25,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209752117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:35:25,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:35:25,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:35:25,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840225367] [2024-10-24 20:35:25,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:35:25,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 20:35:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:35:25,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 20:35:25,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 20:35:25,950 INFO L87 Difference]: Start difference. First operand has 187 states, 95 states have (on average 1.936842105263158) internal successors, (184), 179 states have internal predecessors, (184), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:35:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:35:25,998 INFO L93 Difference]: Finished difference Result 359 states and 390 transitions. [2024-10-24 20:35:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 20:35:26,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-24 20:35:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:35:26,011 INFO L225 Difference]: With dead ends: 359 [2024-10-24 20:35:26,012 INFO L226 Difference]: Without dead ends: 171 [2024-10-24 20:35:26,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 20:35:26,020 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:35:26,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:35:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-24 20:35:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-24 20:35:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.7553191489361701) internal successors, (165), 164 states have internal predecessors, (165), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 20:35:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2024-10-24 20:35:26,072 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 14 [2024-10-24 20:35:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:35:26,073 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2024-10-24 20:35:26,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:35:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2024-10-24 20:35:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 20:35:26,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:35:26,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:35:26,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 20:35:26,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:35:26,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:35:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1920324093, now seen corresponding path program 1 times [2024-10-24 20:35:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:35:26,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427858344] [2024-10-24 20:35:26,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:26,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:35:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:26,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:35:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:26,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:35:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:26,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:35:26,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427858344] [2024-10-24 20:35:26,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427858344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:35:26,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:35:26,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:35:26,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165129642] [2024-10-24 20:35:26,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:35:26,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:35:26,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:35:26,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:35:26,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:35:26,273 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:35:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:35:26,662 INFO L93 Difference]: Finished difference Result 308 states and 320 transitions. [2024-10-24 20:35:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:35:26,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-10-24 20:35:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:35:26,665 INFO L225 Difference]: With dead ends: 308 [2024-10-24 20:35:26,665 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 20:35:26,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:35:26,670 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 20:35:26,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 124 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 20:35:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 20:35:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2024-10-24 20:35:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 168 states have (on average 1.505952380952381) internal successors, (253), 238 states have internal predecessors, (253), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:35:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 263 transitions. [2024-10-24 20:35:26,690 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 263 transitions. Word has length 14 [2024-10-24 20:35:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:35:26,692 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 263 transitions. [2024-10-24 20:35:26,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:35:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 263 transitions. [2024-10-24 20:35:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 20:35:26,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:35:26,693 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:35:26,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 20:35:26,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:35:26,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:35:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1713492121, now seen corresponding path program 1 times [2024-10-24 20:35:26,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:35:26,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211173052] [2024-10-24 20:35:26,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:35:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:35:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:26,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:35:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:26,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:35:26,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211173052] [2024-10-24 20:35:26,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211173052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:35:26,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:35:26,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:35:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026713585] [2024-10-24 20:35:26,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:35:26,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:35:26,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:35:26,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:35:26,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:35:26,839 INFO L87 Difference]: Start difference. First operand 246 states and 263 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:35:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:35:26,925 INFO L93 Difference]: Finished difference Result 265 states and 277 transitions. [2024-10-24 20:35:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:35:26,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-10-24 20:35:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:35:26,928 INFO L225 Difference]: With dead ends: 265 [2024-10-24 20:35:26,928 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 20:35:26,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:35:26,929 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:35:26,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 293 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:35:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 20:35:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2024-10-24 20:35:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 245 states have internal predecessors, (260), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:35:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 270 transitions. [2024-10-24 20:35:26,954 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 270 transitions. Word has length 42 [2024-10-24 20:35:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:35:26,955 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 270 transitions. [2024-10-24 20:35:26,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:35:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 270 transitions. [2024-10-24 20:35:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 20:35:26,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:35:26,957 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:35:26,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 20:35:26,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:35:26,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:35:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1693457243, now seen corresponding path program 1 times [2024-10-24 20:35:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:35:26,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239041571] [2024-10-24 20:35:26,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:35:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:35:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:35:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:35:27,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239041571] [2024-10-24 20:35:27,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239041571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:35:27,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:35:27,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:35:27,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022869342] [2024-10-24 20:35:27,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:35:27,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:35:27,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:35:27,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:35:27,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:35:27,122 INFO L87 Difference]: Start difference. First operand 253 states and 270 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:35:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:35:27,307 INFO L93 Difference]: Finished difference Result 264 states and 272 transitions. [2024-10-24 20:35:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:35:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-24 20:35:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:35:27,310 INFO L225 Difference]: With dead ends: 264 [2024-10-24 20:35:27,311 INFO L226 Difference]: Without dead ends: 259 [2024-10-24 20:35:27,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:35:27,313 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 133 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 20:35:27,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 230 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 20:35:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-24 20:35:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 253. [2024-10-24 20:35:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.457142857142857) internal successors, (255), 245 states have internal predecessors, (255), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:35:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2024-10-24 20:35:27,335 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 44 [2024-10-24 20:35:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:35:27,338 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2024-10-24 20:35:27,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:35:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2024-10-24 20:35:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 20:35:27,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:35:27,339 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:35:27,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 20:35:27,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:35:27,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:35:27,340 INFO L85 PathProgramCache]: Analyzing trace with hash 957567089, now seen corresponding path program 1 times [2024-10-24 20:35:27,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:35:27,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039534811] [2024-10-24 20:35:27,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:35:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:35:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:35:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:35:27,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039534811] [2024-10-24 20:35:27,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039534811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:35:27,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:35:27,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:35:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728302316] [2024-10-24 20:35:27,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:35:27,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:35:27,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:35:27,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:35:27,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:35:27,476 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:35:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:35:27,870 INFO L93 Difference]: Finished difference Result 263 states and 267 transitions. [2024-10-24 20:35:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:35:27,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-10-24 20:35:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:35:27,872 INFO L225 Difference]: With dead ends: 263 [2024-10-24 20:35:27,872 INFO L226 Difference]: Without dead ends: 225 [2024-10-24 20:35:27,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:35:27,873 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 82 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 20:35:27,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 264 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 20:35:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-24 20:35:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2024-10-24 20:35:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 211 states have internal predecessors, (217), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:35:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 227 transitions. [2024-10-24 20:35:27,882 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 227 transitions. Word has length 45 [2024-10-24 20:35:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:35:27,883 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 227 transitions. [2024-10-24 20:35:27,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:35:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 227 transitions. [2024-10-24 20:35:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 20:35:27,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:35:27,888 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:35:27,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 20:35:27,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:35:27,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:35:27,890 INFO L85 PathProgramCache]: Analyzing trace with hash -280525862, now seen corresponding path program 1 times [2024-10-24 20:35:27,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:35:27,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748816418] [2024-10-24 20:35:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:27,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:35:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:35:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:27,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:35:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:27,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:35:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:27,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:35:27,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748816418] [2024-10-24 20:35:27,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748816418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:35:27,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:35:27,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:35:27,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533788290] [2024-10-24 20:35:27,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:35:27,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:35:27,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:35:27,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:35:27,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:35:27,984 INFO L87 Difference]: Start difference. First operand 219 states and 227 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:35:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:35:28,008 INFO L93 Difference]: Finished difference Result 221 states and 227 transitions. [2024-10-24 20:35:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:35:28,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2024-10-24 20:35:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:35:28,011 INFO L225 Difference]: With dead ends: 221 [2024-10-24 20:35:28,011 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 20:35:28,011 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-10-24 20:35:28,012 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:35:28,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:35:28,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 20:35:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-24 20:35:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 141 states have (on average 1.524822695035461) internal successors, (215), 211 states have internal predecessors, (215), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:35:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 225 transitions. [2024-10-24 20:35:28,027 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 225 transitions. Word has length 54 [2024-10-24 20:35:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:35:28,028 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 225 transitions. [2024-10-24 20:35:28,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:35:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 225 transitions. [2024-10-24 20:35:28,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 20:35:28,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:35:28,036 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:35:28,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 20:35:28,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:35:28,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:35:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1964749084, now seen corresponding path program 1 times [2024-10-24 20:35:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:35:28,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112407075] [2024-10-24 20:35:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:35:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:35:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042299938] [2024-10-24 20:35:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:28,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:35:28,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:35:28,061 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-10-24 20:35:28,063 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-10-24 20:35:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:28,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:35:28,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:35:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:28,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:35:28,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:35:28,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112407075] [2024-10-24 20:35:28,251 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:35:28,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042299938] [2024-10-24 20:35:28,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042299938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:35:28,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:35:28,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:35:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471646212] [2024-10-24 20:35:28,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:35:28,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:35:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:35:28,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:35:28,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:35:28,255 INFO L87 Difference]: Start difference. First operand 219 states and 225 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:35:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:35:28,665 INFO L93 Difference]: Finished difference Result 358 states and 374 transitions. [2024-10-24 20:35:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:35:28,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-24 20:35:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:35:28,668 INFO L225 Difference]: With dead ends: 358 [2024-10-24 20:35:28,668 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 20:35:28,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:35:28,669 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 90 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 20:35:28,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 149 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 20:35:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 20:35:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2024-10-24 20:35:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.4036697247706422) internal successors, (306), 288 states have internal predecessors, (306), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 20:35:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 320 transitions. [2024-10-24 20:35:28,687 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 320 transitions. Word has length 59 [2024-10-24 20:35:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:35:28,688 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 320 transitions. [2024-10-24 20:35:28,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:35:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 320 transitions. [2024-10-24 20:35:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 20:35:28,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:35:28,690 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:35:28,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 20:35:28,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:35:28,891 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:35:28,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:35:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash -69304982, now seen corresponding path program 1 times [2024-10-24 20:35:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:35:28,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868948573] [2024-10-24 20:35:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:35:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:35:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:35:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:29,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:35:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:35:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868948573] [2024-10-24 20:35:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868948573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:35:29,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:35:29,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:35:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738500842] [2024-10-24 20:35:29,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:35:29,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:35:29,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:35:29,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:35:29,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:35:29,015 INFO L87 Difference]: Start difference. First operand 298 states and 320 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:35:33,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:35:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:35:33,277 INFO L93 Difference]: Finished difference Result 299 states and 320 transitions. [2024-10-24 20:35:33,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:35:33,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2024-10-24 20:35:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:35:33,280 INFO L225 Difference]: With dead ends: 299 [2024-10-24 20:35:33,280 INFO L226 Difference]: Without dead ends: 298 [2024-10-24 20:35:33,280 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-10-24 20:35:33,281 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 39 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 20:35:33,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 298 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 20:35:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-24 20:35:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-10-24 20:35:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.3990825688073394) internal successors, (305), 288 states have internal predecessors, (305), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 20:35:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 319 transitions. [2024-10-24 20:35:33,295 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 319 transitions. Word has length 65 [2024-10-24 20:35:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:35:33,296 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 319 transitions. [2024-10-24 20:35:33,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:35:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 319 transitions. [2024-10-24 20:35:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 20:35:33,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:35:33,297 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-10-24 20:35:33,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 20:35:33,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:35:33,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:35:33,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1220812152, now seen corresponding path program 1 times [2024-10-24 20:35:33,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:35:33,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822134772] [2024-10-24 20:35:33,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:35:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:35:33,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086512507] [2024-10-24 20:35:33,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:33,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:35:33,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:35:33,327 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-10-24 20:35:33,329 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-10-24 20:35:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:33,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:35:33,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:35:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 20:35:33,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:35:33,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:35:33,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822134772] [2024-10-24 20:35:33,542 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:35:33,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086512507] [2024-10-24 20:35:33,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086512507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:35:33,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:35:33,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:35:33,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690527820] [2024-10-24 20:35:33,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:35:33,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:35:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:35:33,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:35:33,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:35:33,545 INFO L87 Difference]: Start difference. First operand 298 states and 319 transitions. Second operand has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:35:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:35:33,595 INFO L93 Difference]: Finished difference Result 298 states and 319 transitions. [2024-10-24 20:35:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:35:33,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 95 [2024-10-24 20:35:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:35:33,597 INFO L225 Difference]: With dead ends: 298 [2024-10-24 20:35:33,597 INFO L226 Difference]: Without dead ends: 295 [2024-10-24 20:35:33,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:35:33,598 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:35:33,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 156 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:35:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-24 20:35:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-10-24 20:35:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 218 states have (on average 1.3761467889908257) internal successors, (300), 285 states have internal predecessors, (300), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 20:35:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 314 transitions. [2024-10-24 20:35:33,606 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 314 transitions. Word has length 95 [2024-10-24 20:35:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:35:33,607 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 314 transitions. [2024-10-24 20:35:33,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:35:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 314 transitions. [2024-10-24 20:35:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 20:35:33,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:35:33,608 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-10-24 20:35:33,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 20:35:33,809 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,SelfDestructingSolverStorable8 [2024-10-24 20:35:33,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:35:33,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:35:33,810 INFO L85 PathProgramCache]: Analyzing trace with hash 809529056, now seen corresponding path program 1 times [2024-10-24 20:35:33,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:35:33,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365312015] [2024-10-24 20:35:33,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:33,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:35:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:35:33,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645430227] [2024-10-24 20:35:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:33,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:35:33,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:35:33,831 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-10-24 20:35:33,833 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-10-24 20:35:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:33,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 20:35:33,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:35:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:34,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:35:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:34,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:35:34,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365312015] [2024-10-24 20:35:34,389 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:35:34,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645430227] [2024-10-24 20:35:34,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645430227] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 20:35:34,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 20:35:34,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-24 20:35:34,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613019424] [2024-10-24 20:35:34,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 20:35:34,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 20:35:34,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:35:34,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 20:35:34,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:35:34,392 INFO L87 Difference]: Start difference. First operand 295 states and 314 transitions. Second operand has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 20:35:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:35:35,163 INFO L93 Difference]: Finished difference Result 367 states and 382 transitions. [2024-10-24 20:35:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 20:35:35,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 96 [2024-10-24 20:35:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:35:35,165 INFO L225 Difference]: With dead ends: 367 [2024-10-24 20:35:35,165 INFO L226 Difference]: Without dead ends: 360 [2024-10-24 20:35:35,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:35:35,166 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 284 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 20:35:35,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 300 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 20:35:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-24 20:35:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 333. [2024-10-24 20:35:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 257 states have (on average 1.3968871595330739) internal successors, (359), 323 states have internal predecessors, (359), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 20:35:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 373 transitions. [2024-10-24 20:35:35,176 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 373 transitions. Word has length 96 [2024-10-24 20:35:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:35:35,176 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 373 transitions. [2024-10-24 20:35:35,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 20:35:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 373 transitions. [2024-10-24 20:35:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 20:35:35,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:35:35,178 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-10-24 20:35:35,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 20:35:35,378 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-10-24 20:35:35,379 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:35:35,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:35:35,379 INFO L85 PathProgramCache]: Analyzing trace with hash -674402934, now seen corresponding path program 1 times [2024-10-24 20:35:35,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:35:35,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102472072] [2024-10-24 20:35:35,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:35,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:35:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:35:35,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592905507] [2024-10-24 20:35:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:35:35,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:35:35,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:35:35,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:35:35,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 20:35:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:35:35,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 20:35:35,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:35:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:35,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:35:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:35:41,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:35:41,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102472072] [2024-10-24 20:35:41,095 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:35:41,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592905507] [2024-10-24 20:35:41,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592905507] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 20:35:41,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:35:41,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2024-10-24 20:35:41,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844279170] [2024-10-24 20:35:41,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:35:41,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:35:41,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:35:41,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:35:41,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=39, Unknown=1, NotChecked=0, Total=72 [2024-10-24 20:35:41,098 INFO L87 Difference]: Start difference. First operand 333 states and 373 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:35:45,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:35:49,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:35:53,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:35:55,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:36:00,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:36:02,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:36:04,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:36:09,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:36:13,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:36:15,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:36:17,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:36:21,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 20:36:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:21,851 INFO L93 Difference]: Finished difference Result 333 states and 373 transitions. [2024-10-24 20:36:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:36:21,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2024-10-24 20:36:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:21,853 INFO L225 Difference]: With dead ends: 333 [2024-10-24 20:36:21,853 INFO L226 Difference]: Without dead ends: 331 [2024-10-24 20:36:21,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=41, Invalid=48, Unknown=1, NotChecked=0, Total=90 [2024-10-24 20:36:21,854 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 147 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 8 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.7s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:21,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 66 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 415 Invalid, 7 Unknown, 0 Unchecked, 40.7s Time] [2024-10-24 20:36:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-24 20:36:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2024-10-24 20:36:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 257 states have (on average 1.3813229571984436) internal successors, (355), 321 states have internal predecessors, (355), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 20:36:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 369 transitions. [2024-10-24 20:36:21,865 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 369 transitions. Word has length 97 [2024-10-24 20:36:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:21,866 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 369 transitions. [2024-10-24 20:36:21,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:36:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 369 transitions. [2024-10-24 20:36:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 20:36:21,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:21,867 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-10-24 20:36:21,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 20:36:22,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:22,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:22,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash 568345634, now seen corresponding path program 1 times [2024-10-24 20:36:22,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:22,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639748622] [2024-10-24 20:36:22,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:36:22,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1490238328] [2024-10-24 20:36:22,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:22,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:22,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:22,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:22,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 20:36:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:22,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:36:22,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:36:22,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:36:22,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:22,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639748622] [2024-10-24 20:36:22,314 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:36:22,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490238328] [2024-10-24 20:36:22,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490238328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:36:22,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:36:22,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 20:36:22,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236565021] [2024-10-24 20:36:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:36:22,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:36:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:22,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:36:22,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:36:22,317 INFO L87 Difference]: Start difference. First operand 331 states and 369 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:36:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:22,762 INFO L93 Difference]: Finished difference Result 331 states and 369 transitions. [2024-10-24 20:36:22,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:36:22,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 98 [2024-10-24 20:36:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:22,764 INFO L225 Difference]: With dead ends: 331 [2024-10-24 20:36:22,764 INFO L226 Difference]: Without dead ends: 311 [2024-10-24 20:36:22,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:36:22,765 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 114 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:22,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 69 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 20:36:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-24 20:36:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-24 20:36:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 257 states have (on average 1.264591439688716) internal successors, (325), 301 states have internal predecessors, (325), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 20:36:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 339 transitions. [2024-10-24 20:36:22,776 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 339 transitions. Word has length 98 [2024-10-24 20:36:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:22,776 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 339 transitions. [2024-10-24 20:36:22,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:36:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 339 transitions. [2024-10-24 20:36:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 20:36:22,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:22,777 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-10-24 20:36:22,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 20:36:22,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-24 20:36:22,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:22,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:22,979 INFO L85 PathProgramCache]: Analyzing trace with hash 438845580, now seen corresponding path program 1 times [2024-10-24 20:36:22,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:22,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906889564] [2024-10-24 20:36:22,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:22,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:36:23,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809694931] [2024-10-24 20:36:23,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:23,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:23,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:23,005 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:23,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 20:36:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:23,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 20:36:23,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:36:23,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:36:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 20:36:23,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906889564] [2024-10-24 20:36:23,551 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:36:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809694931] [2024-10-24 20:36:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809694931] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 20:36:23,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:36:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-24 20:36:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204853977] [2024-10-24 20:36:23,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:36:23,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:36:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:23,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:36:23,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:36:23,553 INFO L87 Difference]: Start difference. First operand 311 states and 339 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:36:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:25,570 INFO L93 Difference]: Finished difference Result 311 states and 339 transitions. [2024-10-24 20:36:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:36:25,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 99 [2024-10-24 20:36:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:25,572 INFO L225 Difference]: With dead ends: 311 [2024-10-24 20:36:25,572 INFO L226 Difference]: Without dead ends: 309 [2024-10-24 20:36:25,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:36:25,572 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:25,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 41 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 20:36:25,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-24 20:36:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-24 20:36:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 257 states have (on average 1.2490272373540856) internal successors, (321), 299 states have internal predecessors, (321), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 20:36:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 335 transitions. [2024-10-24 20:36:25,589 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 335 transitions. Word has length 99 [2024-10-24 20:36:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:25,589 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 335 transitions. [2024-10-24 20:36:25,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:36:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 335 transitions. [2024-10-24 20:36:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 20:36:25,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:25,591 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:25,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 20:36:25,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:25,792 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:25,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash -920443063, now seen corresponding path program 1 times [2024-10-24 20:36:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:25,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556890230] [2024-10-24 20:36:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:25,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:25,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:36:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:25,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:36:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:25,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:36:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:25,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 20:36:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 20:36:25,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:25,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556890230] [2024-10-24 20:36:25,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556890230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:36:25,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311723232] [2024-10-24 20:36:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:25,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:25,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:25,955 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:25,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 20:36:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:25,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:36:25,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 20:36:26,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:36:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311723232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:36:26,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:36:26,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-24 20:36:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687640560] [2024-10-24 20:36:26,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:36:26,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:36:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:26,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:36:26,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:36:26,086 INFO L87 Difference]: Start difference. First operand 309 states and 335 transitions. Second operand has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 20:36:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:26,122 INFO L93 Difference]: Finished difference Result 309 states and 335 transitions. [2024-10-24 20:36:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:36:26,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 107 [2024-10-24 20:36:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:26,126 INFO L225 Difference]: With dead ends: 309 [2024-10-24 20:36:26,126 INFO L226 Difference]: Without dead ends: 308 [2024-10-24 20:36:26,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:36:26,127 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 25 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:26,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 346 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:36:26,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-24 20:36:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-24 20:36:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 257 states have (on average 1.2412451361867705) internal successors, (319), 298 states have internal predecessors, (319), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 20:36:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 333 transitions. [2024-10-24 20:36:26,140 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 333 transitions. Word has length 107 [2024-10-24 20:36:26,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:26,140 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 333 transitions. [2024-10-24 20:36:26,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 20:36:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 333 transitions. [2024-10-24 20:36:26,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 20:36:26,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:26,142 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:26,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 20:36:26,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:26,342 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:26,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:26,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1531036241, now seen corresponding path program 1 times [2024-10-24 20:36:26,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:26,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360497838] [2024-10-24 20:36:26,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:26,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:36:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:36:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:36:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 20:36:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 20:36:26,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:26,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360497838] [2024-10-24 20:36:26,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360497838] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:36:26,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320819581] [2024-10-24 20:36:26,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:26,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:26,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:26,459 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:26,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 20:36:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:26,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:36:26,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 20:36:26,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:36:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 20:36:26,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320819581] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 20:36:26,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 20:36:26,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-24 20:36:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125677785] [2024-10-24 20:36:26,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 20:36:26,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:36:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:26,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:36:26,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:36:26,729 INFO L87 Difference]: Start difference. First operand 308 states and 333 transitions. Second operand has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 20:36:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:26,771 INFO L93 Difference]: Finished difference Result 407 states and 420 transitions. [2024-10-24 20:36:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:36:26,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 108 [2024-10-24 20:36:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:26,774 INFO L225 Difference]: With dead ends: 407 [2024-10-24 20:36:26,774 INFO L226 Difference]: Without dead ends: 406 [2024-10-24 20:36:26,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:36:26,775 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 68 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:26,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 528 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:36:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-24 20:36:26,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 365. [2024-10-24 20:36:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 312 states have (on average 1.2788461538461537) internal successors, (399), 353 states have internal predecessors, (399), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 20:36:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 417 transitions. [2024-10-24 20:36:26,789 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 417 transitions. Word has length 108 [2024-10-24 20:36:26,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:26,789 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 417 transitions. [2024-10-24 20:36:26,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 20:36:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 417 transitions. [2024-10-24 20:36:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 20:36:26,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:26,791 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:26,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-24 20:36:26,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-24 20:36:26,991 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:26,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash -423331491, now seen corresponding path program 1 times [2024-10-24 20:36:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:26,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613830702] [2024-10-24 20:36:26,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:26,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:36:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:36:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:27,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:36:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 20:36:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 20:36:27,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:27,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613830702] [2024-10-24 20:36:27,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613830702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:36:27,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:36:27,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:36:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062667672] [2024-10-24 20:36:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:36:27,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:36:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:36:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:36:27,082 INFO L87 Difference]: Start difference. First operand 365 states and 417 transitions. Second operand has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:36:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:27,271 INFO L93 Difference]: Finished difference Result 365 states and 417 transitions. [2024-10-24 20:36:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:36:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 120 [2024-10-24 20:36:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:27,274 INFO L225 Difference]: With dead ends: 365 [2024-10-24 20:36:27,274 INFO L226 Difference]: Without dead ends: 358 [2024-10-24 20:36:27,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-10-24 20:36:27,274 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 128 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:27,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 38 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 20:36:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-24 20:36:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2024-10-24 20:36:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 312 states have (on average 1.233974358974359) internal successors, (385), 346 states have internal predecessors, (385), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 20:36:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 403 transitions. [2024-10-24 20:36:27,288 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 403 transitions. Word has length 120 [2024-10-24 20:36:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:27,288 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 403 transitions. [2024-10-24 20:36:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:36:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 403 transitions. [2024-10-24 20:36:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 20:36:27,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:27,289 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:27,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 20:36:27,290 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:27,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:27,290 INFO L85 PathProgramCache]: Analyzing trace with hash -238374285, now seen corresponding path program 1 times [2024-10-24 20:36:27,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:27,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760796363] [2024-10-24 20:36:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:27,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:36:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:27,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:36:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:27,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:36:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:27,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 20:36:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-24 20:36:27,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:27,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760796363] [2024-10-24 20:36:27,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760796363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:36:27,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:36:27,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:36:27,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196708619] [2024-10-24 20:36:27,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:36:27,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:36:27,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:27,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:36:27,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:36:27,361 INFO L87 Difference]: Start difference. First operand 358 states and 403 transitions. Second operand has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:36:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:27,506 INFO L93 Difference]: Finished difference Result 358 states and 403 transitions. [2024-10-24 20:36:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:36:27,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 121 [2024-10-24 20:36:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:27,509 INFO L225 Difference]: With dead ends: 358 [2024-10-24 20:36:27,509 INFO L226 Difference]: Without dead ends: 357 [2024-10-24 20:36:27,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-10-24 20:36:27,509 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 108 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:27,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 38 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:36:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-24 20:36:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-10-24 20:36:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 312 states have (on average 1.2243589743589745) internal successors, (382), 345 states have internal predecessors, (382), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 20:36:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 400 transitions. [2024-10-24 20:36:27,526 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 400 transitions. Word has length 121 [2024-10-24 20:36:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:27,526 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 400 transitions. [2024-10-24 20:36:27,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:36:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 400 transitions. [2024-10-24 20:36:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 20:36:27,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:27,527 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:27,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 20:36:27,528 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:27,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:27,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1444419595, now seen corresponding path program 1 times [2024-10-24 20:36:27,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:27,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357963097] [2024-10-24 20:36:27,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:27,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:36:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301152167] [2024-10-24 20:36:27,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:27,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:27,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:27,553 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:27,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 20:36:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:27,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 20:36:27,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 20:36:27,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:36:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 20:36:27,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:27,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357963097] [2024-10-24 20:36:27,909 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:36:27,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301152167] [2024-10-24 20:36:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301152167] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 20:36:27,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 20:36:27,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-24 20:36:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342809094] [2024-10-24 20:36:27,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 20:36:27,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 20:36:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:27,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 20:36:27,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:36:27,911 INFO L87 Difference]: Start difference. First operand 357 states and 400 transitions. Second operand has 8 states, 7 states have (on average 30.142857142857142) internal successors, (211), 8 states have internal predecessors, (211), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 20:36:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:28,419 INFO L93 Difference]: Finished difference Result 418 states and 453 transitions. [2024-10-24 20:36:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 20:36:28,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.142857142857142) internal successors, (211), 8 states have internal predecessors, (211), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 123 [2024-10-24 20:36:28,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:28,420 INFO L225 Difference]: With dead ends: 418 [2024-10-24 20:36:28,420 INFO L226 Difference]: Without dead ends: 388 [2024-10-24 20:36:28,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:36:28,421 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 272 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:28,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 191 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 20:36:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-24 20:36:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 341. [2024-10-24 20:36:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 301 states have (on average 1.1661129568106312) internal successors, (351), 330 states have internal predecessors, (351), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 20:36:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 367 transitions. [2024-10-24 20:36:28,435 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 367 transitions. Word has length 123 [2024-10-24 20:36:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:28,436 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 367 transitions. [2024-10-24 20:36:28,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.142857142857142) internal successors, (211), 8 states have internal predecessors, (211), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 20:36:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 367 transitions. [2024-10-24 20:36:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 20:36:28,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:28,437 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 20:36:28,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-24 20:36:28,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-24 20:36:28,638 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:28,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash -351277160, now seen corresponding path program 1 times [2024-10-24 20:36:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:28,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509784593] [2024-10-24 20:36:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:36:28,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189551893] [2024-10-24 20:36:28,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:28,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:28,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:28,658 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:28,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 20:36:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:28,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 20:36:28,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 20:36:29,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:36:30,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:30,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509784593] [2024-10-24 20:36:30,584 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:36:30,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189551893] [2024-10-24 20:36:30,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189551893] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:36:30,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:36:30,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-24 20:36:30,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344892462] [2024-10-24 20:36:30,585 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 20:36:30,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:36:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:30,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:36:30,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-24 20:36:30,586 INFO L87 Difference]: Start difference. First operand 341 states and 367 transitions. Second operand has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 20:36:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:30,846 INFO L93 Difference]: Finished difference Result 379 states and 406 transitions. [2024-10-24 20:36:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 20:36:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 146 [2024-10-24 20:36:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:30,848 INFO L225 Difference]: With dead ends: 379 [2024-10-24 20:36:30,848 INFO L226 Difference]: Without dead ends: 378 [2024-10-24 20:36:30,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-24 20:36:30,849 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 22 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:30,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 253 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 20:36:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-24 20:36:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2024-10-24 20:36:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 336 states have (on average 1.1488095238095237) internal successors, (386), 365 states have internal predecessors, (386), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 20:36:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 404 transitions. [2024-10-24 20:36:30,863 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 404 transitions. Word has length 146 [2024-10-24 20:36:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:30,863 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 404 transitions. [2024-10-24 20:36:30,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 20:36:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 404 transitions. [2024-10-24 20:36:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 20:36:30,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:30,865 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 20:36:30,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-24 20:36:31,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:31,066 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:31,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1995310146, now seen corresponding path program 1 times [2024-10-24 20:36:31,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:31,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690945903] [2024-10-24 20:36:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:31,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:36:31,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812033784] [2024-10-24 20:36:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:31,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:31,090 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:31,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-24 20:36:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:31,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 20:36:31,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 20:36:31,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:36:34,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:34,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690945903] [2024-10-24 20:36:34,042 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:36:34,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812033784] [2024-10-24 20:36:34,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812033784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:36:34,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:36:34,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-24 20:36:34,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226416955] [2024-10-24 20:36:34,042 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 20:36:34,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:36:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:34,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:36:34,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-24 20:36:34,044 INFO L87 Difference]: Start difference. First operand 377 states and 404 transitions. Second operand has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 20:36:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:34,405 INFO L93 Difference]: Finished difference Result 379 states and 405 transitions. [2024-10-24 20:36:34,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 20:36:34,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 147 [2024-10-24 20:36:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:34,407 INFO L225 Difference]: With dead ends: 379 [2024-10-24 20:36:34,407 INFO L226 Difference]: Without dead ends: 341 [2024-10-24 20:36:34,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-24 20:36:34,408 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 20 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:34,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 274 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 20:36:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-24 20:36:34,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-10-24 20:36:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 301 states have (on average 1.1627906976744187) internal successors, (350), 330 states have internal predecessors, (350), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 20:36:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 366 transitions. [2024-10-24 20:36:34,438 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 366 transitions. Word has length 147 [2024-10-24 20:36:34,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:34,439 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 366 transitions. [2024-10-24 20:36:34,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 20:36:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 366 transitions. [2024-10-24 20:36:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 20:36:34,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:34,442 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:34,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-24 20:36:34,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:34,643 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:34,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1439281792, now seen corresponding path program 1 times [2024-10-24 20:36:34,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075465273] [2024-10-24 20:36:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:36:34,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128257833] [2024-10-24 20:36:34,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:34,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:34,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:34,671 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:34,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-24 20:36:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:34,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:36:34,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 20:36:34,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:36:34,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075465273] [2024-10-24 20:36:34,932 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:36:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128257833] [2024-10-24 20:36:34,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128257833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:36:34,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:36:34,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 20:36:34,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844086568] [2024-10-24 20:36:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:36:34,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:36:34,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:34,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:36:34,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 20:36:34,934 INFO L87 Difference]: Start difference. First operand 341 states and 366 transitions. Second operand has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 20:36:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:35,244 INFO L93 Difference]: Finished difference Result 351 states and 378 transitions. [2024-10-24 20:36:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:36:35,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 166 [2024-10-24 20:36:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:35,246 INFO L225 Difference]: With dead ends: 351 [2024-10-24 20:36:35,246 INFO L226 Difference]: Without dead ends: 338 [2024-10-24 20:36:35,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 20:36:35,247 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 155 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:35,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 136 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 20:36:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-24 20:36:35,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 325. [2024-10-24 20:36:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 298 states have (on average 1.0973154362416107) internal successors, (327), 314 states have internal predecessors, (327), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 20:36:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 343 transitions. [2024-10-24 20:36:35,260 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 343 transitions. Word has length 166 [2024-10-24 20:36:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:35,260 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 343 transitions. [2024-10-24 20:36:35,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 20:36:35,261 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 343 transitions. [2024-10-24 20:36:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 20:36:35,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:35,262 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:35,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-24 20:36:35,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-24 20:36:35,467 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:35,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1668062458, now seen corresponding path program 1 times [2024-10-24 20:36:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877313341] [2024-10-24 20:36:35,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:35,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:36:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [655268538] [2024-10-24 20:36:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:35,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:35,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:35,490 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:35,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-24 20:36:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:35,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:36:35,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 20:36:35,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:36:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:35,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877313341] [2024-10-24 20:36:35,817 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:36:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655268538] [2024-10-24 20:36:35,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655268538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:36:35,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:36:35,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-10-24 20:36:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063044000] [2024-10-24 20:36:35,817 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 20:36:35,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:36:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:35,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:36:35,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:36:35,818 INFO L87 Difference]: Start difference. First operand 325 states and 343 transitions. Second operand has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 20:36:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:36,154 INFO L93 Difference]: Finished difference Result 381 states and 403 transitions. [2024-10-24 20:36:36,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:36:36,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 167 [2024-10-24 20:36:36,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:36,156 INFO L225 Difference]: With dead ends: 381 [2024-10-24 20:36:36,156 INFO L226 Difference]: Without dead ends: 378 [2024-10-24 20:36:36,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:36:36,157 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 117 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:36,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 92 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 20:36:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-24 20:36:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 325. [2024-10-24 20:36:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 298 states have (on average 1.087248322147651) internal successors, (324), 314 states have internal predecessors, (324), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 20:36:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 340 transitions. [2024-10-24 20:36:36,170 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 340 transitions. Word has length 167 [2024-10-24 20:36:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:36,171 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 340 transitions. [2024-10-24 20:36:36,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 20:36:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 340 transitions. [2024-10-24 20:36:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 20:36:36,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:36,172 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:36,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-24 20:36:36,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-24 20:36:36,377 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:36,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash -985216376, now seen corresponding path program 1 times [2024-10-24 20:36:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:36,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186555541] [2024-10-24 20:36:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:36,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:36:36,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022272345] [2024-10-24 20:36:36,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:36,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:36,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:36,407 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:36,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-24 20:36:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:36,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 20:36:36,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 20:36:36,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:36:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 20:36:36,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:36,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186555541] [2024-10-24 20:36:36,970 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:36:36,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022272345] [2024-10-24 20:36:36,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022272345] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 20:36:36,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 20:36:36,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-24 20:36:36,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863252912] [2024-10-24 20:36:36,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 20:36:36,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 20:36:36,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:36,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 20:36:36,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:36:36,972 INFO L87 Difference]: Start difference. First operand 325 states and 340 transitions. Second operand has 10 states, 9 states have (on average 32.55555555555556) internal successors, (293), 10 states have internal predecessors, (293), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-24 20:36:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:37,496 INFO L93 Difference]: Finished difference Result 399 states and 422 transitions. [2024-10-24 20:36:37,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 20:36:37,496 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 32.55555555555556) internal successors, (293), 10 states have internal predecessors, (293), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 169 [2024-10-24 20:36:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:37,498 INFO L225 Difference]: With dead ends: 399 [2024-10-24 20:36:37,498 INFO L226 Difference]: Without dead ends: 388 [2024-10-24 20:36:37,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-24 20:36:37,498 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 365 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:37,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 250 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 20:36:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-24 20:36:37,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 312. [2024-10-24 20:36:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 292 states have (on average 1.047945205479452) internal successors, (306), 301 states have internal predecessors, (306), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 20:36:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 322 transitions. [2024-10-24 20:36:37,513 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 322 transitions. Word has length 169 [2024-10-24 20:36:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:37,513 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 322 transitions. [2024-10-24 20:36:37,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 32.55555555555556) internal successors, (293), 10 states have internal predecessors, (293), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-24 20:36:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 322 transitions. [2024-10-24 20:36:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 20:36:37,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:37,515 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:37,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-24 20:36:37,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:37,716 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:37,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1900127734, now seen corresponding path program 1 times [2024-10-24 20:36:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784489409] [2024-10-24 20:36:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:37,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:36:37,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667807290] [2024-10-24 20:36:37,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:37,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:37,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:37,744 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:37,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-24 20:36:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:36:37,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 20:36:37,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 20:36:38,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:36:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 20:36:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784489409] [2024-10-24 20:36:38,520 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:36:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667807290] [2024-10-24 20:36:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667807290] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 20:36:38,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 20:36:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-24 20:36:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409385089] [2024-10-24 20:36:38,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 20:36:38,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 20:36:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:38,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 20:36:38,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-10-24 20:36:38,522 INFO L87 Difference]: Start difference. First operand 312 states and 322 transitions. Second operand has 14 states, 13 states have (on average 22.846153846153847) internal successors, (297), 14 states have internal predecessors, (297), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-24 20:36:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:39,762 INFO L93 Difference]: Finished difference Result 553 states and 589 transitions. [2024-10-24 20:36:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 20:36:39,762 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 22.846153846153847) internal successors, (297), 14 states have internal predecessors, (297), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 171 [2024-10-24 20:36:39,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:39,765 INFO L225 Difference]: With dead ends: 553 [2024-10-24 20:36:39,766 INFO L226 Difference]: Without dead ends: 552 [2024-10-24 20:36:39,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=179, Unknown=0, NotChecked=0, Total=306 [2024-10-24 20:36:39,766 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 463 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:39,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 196 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 20:36:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-24 20:36:39,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 420. [2024-10-24 20:36:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 398 states have (on average 1.0628140703517588) internal successors, (423), 407 states have internal predecessors, (423), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 20:36:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 443 transitions. [2024-10-24 20:36:39,789 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 443 transitions. Word has length 171 [2024-10-24 20:36:39,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:39,789 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 443 transitions. [2024-10-24 20:36:39,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 22.846153846153847) internal successors, (297), 14 states have internal predecessors, (297), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-24 20:36:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 443 transitions. [2024-10-24 20:36:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-24 20:36:39,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:39,791 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:39,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-24 20:36:39,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:39,995 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:39,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:39,996 INFO L85 PathProgramCache]: Analyzing trace with hash 396242567, now seen corresponding path program 2 times [2024-10-24 20:36:39,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:39,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562634264] [2024-10-24 20:36:39,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:39,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:36:40,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961271519] [2024-10-24 20:36:40,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 20:36:40,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:40,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:40,031 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:40,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-24 20:36:40,082 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 20:36:40,082 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 20:36:40,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:36:40,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:36:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-24 20:36:40,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:36:40,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:36:40,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562634264] [2024-10-24 20:36:40,596 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:36:40,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961271519] [2024-10-24 20:36:40,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961271519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:36:40,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:36:40,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 20:36:40,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423858324] [2024-10-24 20:36:40,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:36:40,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:36:40,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:36:40,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:36:40,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:36:40,598 INFO L87 Difference]: Start difference. First operand 420 states and 443 transitions. Second operand has 5 states, 4 states have (on average 28.0) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 20:36:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:36:40,731 INFO L93 Difference]: Finished difference Result 420 states and 443 transitions. [2024-10-24 20:36:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:36:40,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 199 [2024-10-24 20:36:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:36:40,733 INFO L225 Difference]: With dead ends: 420 [2024-10-24 20:36:40,733 INFO L226 Difference]: Without dead ends: 361 [2024-10-24 20:36:40,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:36:40,734 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 52 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:36:40,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 45 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:36:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-24 20:36:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-10-24 20:36:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 344 states have (on average 1.0494186046511629) internal successors, (361), 349 states have internal predecessors, (361), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 20:36:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 379 transitions. [2024-10-24 20:36:40,756 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 379 transitions. Word has length 199 [2024-10-24 20:36:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:36:40,757 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 379 transitions. [2024-10-24 20:36:40,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 20:36:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 379 transitions. [2024-10-24 20:36:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-24 20:36:40,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:36:40,758 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:40,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-24 20:36:40,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-24 20:36:40,959 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-24 20:36:40,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:36:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1769144768, now seen corresponding path program 2 times [2024-10-24 20:36:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:36:40,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587262035] [2024-10-24 20:36:40,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:36:40,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:36:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:36:40,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925572251] [2024-10-24 20:36:40,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 20:36:40,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:36:40,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:40,983 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:36:40,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-24 20:36:41,070 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 20:36:41,070 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-10-24 20:36:41,071 WARN L124 FreeRefinementEngine]: Strategy CAMEL was unsuccessful and could not determine trace feasibility [2024-10-24 20:36:41,071 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-10-24 20:36:41,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 84 remaining) [2024-10-24 20:36:41,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 84 remaining) [2024-10-24 20:36:41,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 84 remaining) [2024-10-24 20:36:41,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 84 remaining) [2024-10-24 20:36:41,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 84 remaining) [2024-10-24 20:36:41,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 84 remaining) [2024-10-24 20:36:41,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 84 remaining) [2024-10-24 20:36:41,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 84 remaining) [2024-10-24 20:36:41,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 84 remaining) [2024-10-24 20:36:41,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 84 remaining) [2024-10-24 20:36:41,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 84 remaining) [2024-10-24 20:36:41,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 84 remaining) [2024-10-24 20:36:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 84 remaining) [2024-10-24 20:36:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 84 remaining) [2024-10-24 20:36:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 84 remaining) [2024-10-24 20:36:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 84 remaining) [2024-10-24 20:36:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 84 remaining) [2024-10-24 20:36:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 84 remaining) [2024-10-24 20:36:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 84 remaining) [2024-10-24 20:36:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 84 remaining) [2024-10-24 20:36:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 84 remaining) [2024-10-24 20:36:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 84 remaining) [2024-10-24 20:36:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 84 remaining) [2024-10-24 20:36:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 84 remaining) [2024-10-24 20:36:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 84 remaining) [2024-10-24 20:36:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 84 remaining) [2024-10-24 20:36:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 84 remaining) [2024-10-24 20:36:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 84 remaining) [2024-10-24 20:36:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 84 remaining) [2024-10-24 20:36:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 84 remaining) [2024-10-24 20:36:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 84 remaining) [2024-10-24 20:36:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 84 remaining) [2024-10-24 20:36:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 84 remaining) [2024-10-24 20:36:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 84 remaining) [2024-10-24 20:36:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 84 remaining) [2024-10-24 20:36:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 84 remaining) [2024-10-24 20:36:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 84 remaining) [2024-10-24 20:36:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 84 remaining) [2024-10-24 20:36:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 84 remaining) [2024-10-24 20:36:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 84 remaining) [2024-10-24 20:36:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 84 remaining) [2024-10-24 20:36:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 84 remaining) [2024-10-24 20:36:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 84 remaining) [2024-10-24 20:36:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 84 remaining) [2024-10-24 20:36:41,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 84 remaining) [2024-10-24 20:36:41,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 84 remaining) [2024-10-24 20:36:41,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 84 remaining) [2024-10-24 20:36:41,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 84 remaining) [2024-10-24 20:36:41,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 84 remaining) [2024-10-24 20:36:41,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 84 remaining) [2024-10-24 20:36:41,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 84 remaining) [2024-10-24 20:36:41,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 84 remaining) [2024-10-24 20:36:41,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 84 remaining) [2024-10-24 20:36:41,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 84 remaining) [2024-10-24 20:36:41,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 84 remaining) [2024-10-24 20:36:41,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 84 remaining) [2024-10-24 20:36:41,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 84 remaining) [2024-10-24 20:36:41,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 84 remaining) [2024-10-24 20:36:41,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 84 remaining) [2024-10-24 20:36:41,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 84 remaining) [2024-10-24 20:36:41,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 84 remaining) [2024-10-24 20:36:41,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 84 remaining) [2024-10-24 20:36:41,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 84 remaining) [2024-10-24 20:36:41,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 84 remaining) [2024-10-24 20:36:41,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 84 remaining) [2024-10-24 20:36:41,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 84 remaining) [2024-10-24 20:36:41,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 84 remaining) [2024-10-24 20:36:41,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 84 remaining) [2024-10-24 20:36:41,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 84 remaining) [2024-10-24 20:36:41,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 84 remaining) [2024-10-24 20:36:41,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 84 remaining) [2024-10-24 20:36:41,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 84 remaining) [2024-10-24 20:36:41,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 84 remaining) [2024-10-24 20:36:41,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-24 20:36:41,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-24 20:36:41,290 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:36:41,312 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 20:36:41,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:36:41 BoogieIcfgContainer [2024-10-24 20:36:41,315 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 20:36:41,315 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 20:36:41,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 20:36:41,316 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 20:36:41,316 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:35:25" (3/4) ... [2024-10-24 20:36:41,318 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 20:36:41,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 20:36:41,319 INFO L158 Benchmark]: Toolchain (without parser) took 76724.02ms. Allocated memory was 180.4MB in the beginning and 237.0MB in the end (delta: 56.6MB). Free memory was 113.6MB in the beginning and 153.9MB in the end (delta: -40.3MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2024-10-24 20:36:41,320 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 107.0MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:36:41,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.91ms. Allocated memory is still 180.4MB. Free memory was 113.3MB in the beginning and 100.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 20:36:41,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.76ms. Allocated memory is still 180.4MB. Free memory was 100.6MB in the beginning and 153.5MB in the end (delta: -52.9MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-10-24 20:36:41,320 INFO L158 Benchmark]: Boogie Preprocessor took 72.55ms. Allocated memory is still 180.4MB. Free memory was 153.5MB in the beginning and 151.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 20:36:41,321 INFO L158 Benchmark]: RCFGBuilder took 611.71ms. Allocated memory is still 180.4MB. Free memory was 151.7MB in the beginning and 120.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 20:36:41,321 INFO L158 Benchmark]: TraceAbstraction took 75676.89ms. Allocated memory was 180.4MB in the beginning and 237.0MB in the end (delta: 56.6MB). Free memory was 119.5MB in the beginning and 153.9MB in the end (delta: -34.4MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-10-24 20:36:41,321 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 237.0MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:36:41,322 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 107.0MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.91ms. Allocated memory is still 180.4MB. Free memory was 113.3MB in the beginning and 100.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.76ms. Allocated memory is still 180.4MB. Free memory was 100.6MB in the beginning and 153.5MB in the end (delta: -52.9MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.55ms. Allocated memory is still 180.4MB. Free memory was 153.5MB in the beginning and 151.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.71ms. Allocated memory is still 180.4MB. Free memory was 151.7MB in the beginning and 120.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 75676.89ms. Allocated memory was 180.4MB in the beginning and 237.0MB in the end (delta: 56.6MB). Free memory was 119.5MB in the beginning and 153.9MB in the end (delta: -34.4MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 237.0MB. Free memory is still 153.9MB. There was no memory consumed. 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 - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L18] short k; [L19] long long y, x, c; [L20] k = __VERIFIER_nondet_short() [L21] CALL assume_abort_if_not(k>=0 && k<=10) [L7] COND FALSE !(!cond) [L21] RET assume_abort_if_not(k>=0 && k<=10) [L22] CALL assume_abort_if_not(k <= 256) [L7] COND FALSE !(!cond) [L22] RET assume_abort_if_not(k <= 256) [L24] y = 0 [L25] x = 0 [L26] c = 0 [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] 30*x - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: 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: 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: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 187 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 75.6s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 54.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 3032 SdHoareTripleChecker+Valid, 53.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2999 mSDsluCounter, 4886 SdHoareTripleChecker+Invalid, 52.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2789 mSDsCounter, 279 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8538 IncrementalHoareTripleChecker+Invalid, 8825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 279 mSolverCounterUnsat, 2097 mSDtfsCounter, 8538 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3194 GetRequests, 3077 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=24, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 421 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 5017 NumberOfCodeBlocks, 4866 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3610 ConstructedInterpolants, 0 QuantifiedInterpolants, 27262 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2710 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 34 InterpolantComputations, 17 PerfectInterpolantSequences, 827/2021 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 could not prove your program: unable to determine feasibility of some traces [2024-10-24 20:36:41,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 20:36:43,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 20:36:43,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-10-24 20:36:43,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 20:36:43,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 20:36:43,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 20:36:43,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 20:36:43,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 20:36:43,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 20:36:43,453 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 20:36:43,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 20:36:43,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 20:36:43,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 20:36:43,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 20:36:43,455 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 20:36:43,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 20:36:43,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 20:36:43,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 20:36:43,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 20:36:43,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 20:36:43,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 20:36:43,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 20:36:43,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 20:36:43,463 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 20:36:43,464 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 20:36:43,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 20:36:43,464 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 20:36:43,464 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 20:36:43,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 20:36:43,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 20:36:43,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 20:36:43,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 20:36:43,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 20:36:43,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 20:36:43,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 20:36:43,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 20:36:43,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:36:43,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 20:36:43,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 20:36:43,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 20:36:43,475 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 20:36:43,475 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 20:36:43,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 20:36:43,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 20:36:43,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 20:36:43,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 20:36:43,476 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 20:36:43,476 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 -> 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc [2024-10-24 20:36:43,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 20:36:43,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 20:36:43,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 20:36:43,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 20:36:43,800 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 20:36:43,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2024-10-24 20:36:45,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 20:36:45,516 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 20:36:45,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2024-10-24 20:36:45,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc94d4ae7/93729dafc51a4419bf9e75bc3ba132a0/FLAG719261332 [2024-10-24 20:36:45,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc94d4ae7/93729dafc51a4419bf9e75bc3ba132a0 [2024-10-24 20:36:45,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 20:36:45,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 20:36:45,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 20:36:45,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 20:36:45,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 20:36:45,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:36:45" (1/1) ... [2024-10-24 20:36:45,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387b7e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:45, skipping insertion in model container [2024-10-24 20:36:45,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:36:45" (1/1) ... [2024-10-24 20:36:45,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 20:36:46,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:36:46,168 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 20:36:46,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:36:46,221 INFO L204 MainTranslator]: Completed translation [2024-10-24 20:36:46,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46 WrapperNode [2024-10-24 20:36:46,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 20:36:46,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 20:36:46,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 20:36:46,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 20:36:46,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,266 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2024-10-24 20:36:46,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 20:36:46,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 20:36:46,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 20:36:46,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 20:36:46,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,297 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-10-24 20:36:46,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 20:36:46,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 20:36:46,315 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 20:36:46,315 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 20:36:46,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:36:46" (1/1) ... [2024-10-24 20:36:46,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:36:46,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:36:46,357 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-10-24 20:36:46,364 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-10-24 20:36:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 20:36:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 20:36:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 20:36:46,407 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 20:36:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 20:36:46,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 20:36:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 20:36:46,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 20:36:46,462 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 20:36:46,464 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation