./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/hard-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3f64d9b496c4f5484a31fbfb0a7c6af8258ace1e653eee382e318ab929fd1285 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:55:12,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:55:12,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:55:12,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:55:12,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:55:12,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:55:12,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:55:12,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:55:12,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:55:12,608 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:55:12,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:55:12,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:55:12,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:55:12,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:55:12,610 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:55:12,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:55:12,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:55:12,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:55:12,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:55:12,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:55:12,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:55:12,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:55:12,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:55:12,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:55:12,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:55:12,613 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:55:12,613 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:55:12,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:55:12,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:55:12,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:55:12,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:55:12,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:55:12,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:55:12,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:55:12,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:55:12,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:55:12,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:55:12,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:55:12,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:55:12,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:55:12,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:55:12,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:55:12,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:55:12,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:55:12,616 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-clean/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-clean/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 -> 3f64d9b496c4f5484a31fbfb0a7c6af8258ace1e653eee382e318ab929fd1285 [2024-10-11 20:55:12,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:55:12,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:55:12,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:55:12,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:55:12,826 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:55:12,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c [2024-10-11 20:55:14,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:55:14,158 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:55:14,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c [2024-10-11 20:55:14,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e3b73ec3f/45d791537f404d11904be3e9dd6f3e93/FLAGae7517563 [2024-10-11 20:55:14,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e3b73ec3f/45d791537f404d11904be3e9dd6f3e93 [2024-10-11 20:55:14,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:55:14,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:55:14,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:55:14,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:55:14,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:55:14,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f058c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14, skipping insertion in model container [2024-10-11 20:55:14,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:55:14,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:55:14,376 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:55:14,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:55:14,402 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:55:14,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14 WrapperNode [2024-10-11 20:55:14,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:55:14,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:55:14,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:55:14,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:55:14,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,435 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-10-11 20:55:14,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:55:14,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:55:14,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:55:14,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:55:14,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,456 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-11 20:55:14,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:55:14,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:55:14,465 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:55:14,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:55:14,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (1/1) ... [2024-10-11 20:55:14,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:55:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:55:14,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:55:14,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:55:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:55:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:55:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:55:14,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:55:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:55:14,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:55:14,579 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:55:14,580 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:55:14,830 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-11 20:55:14,830 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:55:14,850 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:55:14,851 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:55:14,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:55:14 BoogieIcfgContainer [2024-10-11 20:55:14,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:55:14,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:55:14,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:55:14,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:55:14,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:55:14" (1/3) ... [2024-10-11 20:55:14,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29695788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:55:14, skipping insertion in model container [2024-10-11 20:55:14,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:55:14" (2/3) ... [2024-10-11 20:55:14,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29695788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:55:14, skipping insertion in model container [2024-10-11 20:55:14,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:55:14" (3/3) ... [2024-10-11 20:55:14,859 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound1.c [2024-10-11 20:55:14,873 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:55:14,873 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-11 20:55:14,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:55:14,933 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;@d035119, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:55:14,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-11 20:55:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 42 states have (on average 1.880952380952381) internal successors, (79), 70 states have internal predecessors, (79), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:55:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:55:14,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:14,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:55:14,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:14,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash 163621270, now seen corresponding path program 1 times [2024-10-11 20:55:14,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:14,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114108587] [2024-10-11 20:55:14,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:14,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:55:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114108587] [2024-10-11 20:55:15,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114108587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:15,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:15,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:55:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105583112] [2024-10-11 20:55:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:15,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:55:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:15,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:55:15,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:55:15,093 INFO L87 Difference]: Start difference. First operand has 79 states, 42 states have (on average 1.880952380952381) internal successors, (79), 70 states have internal predecessors, (79), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:55:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:15,115 INFO L93 Difference]: Finished difference Result 156 states and 190 transitions. [2024-10-11 20:55:15,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:55:15,117 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:55:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:15,122 INFO L225 Difference]: With dead ends: 156 [2024-10-11 20:55:15,122 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 20:55:15,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:55:15,129 INFO L432 NwaCegarLoop]: 87 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, 87 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-11 20:55:15,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:55:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 20:55:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 20:55:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 68 states have internal predecessors, (73), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:55:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-10-11 20:55:15,161 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 5 [2024-10-11 20:55:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:15,161 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-10-11 20:55:15,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:55:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-10-11 20:55:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:55:15,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:15,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:55:15,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:55:15,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:15,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash 163680852, now seen corresponding path program 1 times [2024-10-11 20:55:15,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:15,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105418537] [2024-10-11 20:55:15,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:55:15,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:15,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105418537] [2024-10-11 20:55:15,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105418537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:15,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:15,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:55:15,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718139925] [2024-10-11 20:55:15,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:15,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:55:15,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:15,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:55:15,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:55:15,257 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:55:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:15,304 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2024-10-11 20:55:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:55:15,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:55:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:15,306 INFO L225 Difference]: With dead ends: 131 [2024-10-11 20:55:15,306 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 20:55:15,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11 20:55:15,307 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:15,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 228 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:55:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 20:55:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 20:55:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 states have internal predecessors, (77), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:55:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-10-11 20:55:15,314 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 5 [2024-10-11 20:55:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:15,314 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-10-11 20:55:15,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:55:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-10-11 20:55:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:55:15,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:15,316 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:15,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:55:15,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:15,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:15,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1612836388, now seen corresponding path program 1 times [2024-10-11 20:55:15,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:15,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840094466] [2024-10-11 20:55:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:15,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:55:15,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821862315] [2024-10-11 20:55:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:15,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:15,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:55:15,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:55:15,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:55:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:15,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:55:15,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:55:15,462 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-11 20:55:15,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:55:15,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:15,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840094466] [2024-10-11 20:55:15,463 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:55:15,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821862315] [2024-10-11 20:55:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821862315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:15,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:15,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:55:15,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029620589] [2024-10-11 20:55:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:15,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:55:15,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:15,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:55:15,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:55:15,469 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11 20:55:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:15,530 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2024-10-11 20:55:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:55:15,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 18 [2024-10-11 20:55:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:15,532 INFO L225 Difference]: With dead ends: 172 [2024-10-11 20:55:15,532 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 20:55:15,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-11 20:55:15,533 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:15,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:55:15,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 20:55:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2024-10-11 20:55:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.6666666666666667) internal successors, (105), 90 states have internal predecessors, (105), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:55:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-10-11 20:55:15,548 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 18 [2024-10-11 20:55:15,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:15,549 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-10-11 20:55:15,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11 20:55:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-10-11 20:55:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 20:55:15,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:15,551 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:15,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:55:15,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:15,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:15,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1309924490, now seen corresponding path program 1 times [2024-10-11 20:55:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:15,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486121695] [2024-10-11 20:55:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:15,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:15,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:55:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:15,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:55:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:15,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:55:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:15,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:15,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486121695] [2024-10-11 20:55:15,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486121695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:15,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:15,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:55:15,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328540540] [2024-10-11 20:55:15,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:15,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:55:15,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:15,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:55:15,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:55:15,897 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:15,964 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2024-10-11 20:55:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:55:15,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-10-11 20:55:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:15,966 INFO L225 Difference]: With dead ends: 102 [2024-10-11 20:55:15,966 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 20:55:15,966 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-11 20:55:15,967 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 48 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:15,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:55:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 20:55:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 20:55:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.619047619047619) internal successors, (102), 88 states have internal predecessors, (102), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:55:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2024-10-11 20:55:15,977 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 26 [2024-10-11 20:55:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:15,978 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2024-10-11 20:55:15,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2024-10-11 20:55:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:55:15,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:15,978 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:15,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:55:15,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:15,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:15,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1952954963, now seen corresponding path program 1 times [2024-10-11 20:55:15,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:15,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373057501] [2024-10-11 20:55:15,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:15,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:55:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:55:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:55:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:16,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:16,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373057501] [2024-10-11 20:55:16,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373057501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:16,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:16,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:55:16,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600709177] [2024-10-11 20:55:16,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:16,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:55:16,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:16,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:55:16,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:55:16,122 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:16,196 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2024-10-11 20:55:16,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:55:16,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-11 20:55:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:16,199 INFO L225 Difference]: With dead ends: 136 [2024-10-11 20:55:16,199 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 20:55:16,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:55:16,200 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 31 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:16,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 413 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:55:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 20:55:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-10-11 20:55:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 84 states have internal predecessors, (92), 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-11 20:55:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-10-11 20:55:16,207 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 27 [2024-10-11 20:55:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:16,207 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-10-11 20:55:16,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-10-11 20:55:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:55:16,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:16,208 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:16,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:55:16,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1952953457, now seen corresponding path program 1 times [2024-10-11 20:55:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:16,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019411361] [2024-10-11 20:55:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:16,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:55:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:55:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:55:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:16,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:16,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019411361] [2024-10-11 20:55:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019411361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:16,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:55:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296709951] [2024-10-11 20:55:16,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:16,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:55:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:16,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:55:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:55:16,276 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:16,311 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2024-10-11 20:55:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:55:16,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-11 20:55:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:16,313 INFO L225 Difference]: With dead ends: 101 [2024-10-11 20:55:16,313 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 20:55:16,314 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-11 20:55:16,315 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:16,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:55:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 20:55:16,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-10-11 20:55:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 84 states have internal predecessors, (91), 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-11 20:55:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-10-11 20:55:16,327 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 27 [2024-10-11 20:55:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:16,327 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-10-11 20:55:16,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:16,328 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-10-11 20:55:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 20:55:16,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:16,328 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:16,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:55:16,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:16,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash -412061625, now seen corresponding path program 1 times [2024-10-11 20:55:16,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:16,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125444974] [2024-10-11 20:55:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:16,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:55:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:55:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:55:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:16,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:16,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125444974] [2024-10-11 20:55:16,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125444974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:16,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:16,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:55:16,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264158691] [2024-10-11 20:55:16,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:16,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:55:16,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:55:16,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:55:16,416 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:16,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:16,479 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2024-10-11 20:55:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:55:16,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-10-11 20:55:16,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:16,480 INFO L225 Difference]: With dead ends: 101 [2024-10-11 20:55:16,480 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 20:55:16,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:55:16,481 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 21 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:16,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 411 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:55:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 20:55:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-10-11 20:55:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 84 states have internal predecessors, (90), 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-11 20:55:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-10-11 20:55:16,490 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 28 [2024-10-11 20:55:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:16,491 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-10-11 20:55:16,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-10-11 20:55:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 20:55:16,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:16,493 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:16,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:55:16,495 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:16,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:16,495 INFO L85 PathProgramCache]: Analyzing trace with hash -854227561, now seen corresponding path program 1 times [2024-10-11 20:55:16,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:16,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493560135] [2024-10-11 20:55:16,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:55:16,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756691094] [2024-10-11 20:55:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:16,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:16,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:55:16,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:55:16,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:55:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:55:16,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:55:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:16,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:55:16,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:16,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493560135] [2024-10-11 20:55:16,580 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:55:16,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756691094] [2024-10-11 20:55:16,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756691094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:16,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:16,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:55:16,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670202175] [2024-10-11 20:55:16,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:16,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:55:16,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:16,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:55:16,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:55:16,583 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:16,653 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2024-10-11 20:55:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:55:16,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-11 20:55:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:16,658 INFO L225 Difference]: With dead ends: 134 [2024-10-11 20:55:16,658 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 20:55:16,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-11 20:55:16,659 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 43 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:16,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 102 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:55:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 20:55:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2024-10-11 20:55:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 102 states have internal predecessors, (120), 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-11 20:55:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2024-10-11 20:55:16,666 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 30 [2024-10-11 20:55:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:16,666 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2024-10-11 20:55:16,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2024-10-11 20:55:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 20:55:16,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:16,667 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:16,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:55:16,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:16,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:16,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash 679168499, now seen corresponding path program 1 times [2024-10-11 20:55:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:16,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466834279] [2024-10-11 20:55:16,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:16,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:55:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:55:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:55:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:16,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466834279] [2024-10-11 20:55:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466834279] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:55:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418659893] [2024-10-11 20:55:16,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:16,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:16,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:55:16,969 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:55:16,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:55:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:17,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:55:17,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:55:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:17,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:55:17,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418659893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:17,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:55:17,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 20:55:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897737720] [2024-10-11 20:55:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:17,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:55:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:17,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:55:17,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:55:17,080 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:17,103 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2024-10-11 20:55:17,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:55:17,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-10-11 20:55:17,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:17,104 INFO L225 Difference]: With dead ends: 124 [2024-10-11 20:55:17,104 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 20:55:17,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:55:17,105 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 19 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:17,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 194 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:55:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 20:55:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2024-10-11 20:55:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 80 states have (on average 1.525) internal successors, (122), 104 states have internal predecessors, (122), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:55:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2024-10-11 20:55:17,112 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 31 [2024-10-11 20:55:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:17,112 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2024-10-11 20:55:17,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2024-10-11 20:55:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 20:55:17,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:17,113 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:17,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:55:17,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:17,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:17,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:17,315 INFO L85 PathProgramCache]: Analyzing trace with hash -573928199, now seen corresponding path program 1 times [2024-10-11 20:55:17,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:17,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815649240] [2024-10-11 20:55:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:17,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:17,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:55:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:55:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:55:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:17,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:17,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815649240] [2024-10-11 20:55:17,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815649240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:17,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:17,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:55:17,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446576610] [2024-10-11 20:55:17,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:17,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:55:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:55:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:55:17,395 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:17,706 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2024-10-11 20:55:17,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:55:17,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-11 20:55:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:17,707 INFO L225 Difference]: With dead ends: 131 [2024-10-11 20:55:17,707 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 20:55:17,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:55:17,708 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 56 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:17,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 144 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:55:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 20:55:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2024-10-11 20:55:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 105 states have internal predecessors, (123), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:55:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 143 transitions. [2024-10-11 20:55:17,714 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 143 transitions. Word has length 32 [2024-10-11 20:55:17,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:17,715 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 143 transitions. [2024-10-11 20:55:17,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:17,715 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2024-10-11 20:55:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 20:55:17,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:17,715 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:17,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:55:17,715 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:17,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:17,716 INFO L85 PathProgramCache]: Analyzing trace with hash -420612963, now seen corresponding path program 1 times [2024-10-11 20:55:17,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:17,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996775421] [2024-10-11 20:55:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:55:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:17,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:55:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:17,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:55:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:17,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:17,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996775421] [2024-10-11 20:55:17,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996775421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:55:17,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940941679] [2024-10-11 20:55:17,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:17,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:17,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:55:17,782 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:55:17,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:55:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:17,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:55:17,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:55:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:17,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:55:17,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940941679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:17,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:55:17,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-10-11 20:55:17,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682559745] [2024-10-11 20:55:17,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:17,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:55:17,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:17,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:55:17,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:55:17,856 INFO L87 Difference]: Start difference. First operand 119 states and 143 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:17,894 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2024-10-11 20:55:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:55:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-11 20:55:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:17,897 INFO L225 Difference]: With dead ends: 124 [2024-10-11 20:55:17,897 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 20:55:17,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:55:17,897 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 16 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:17,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 265 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:55:17,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 20:55:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2024-10-11 20:55:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 104 states have internal predecessors, (122), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:55:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2024-10-11 20:55:17,908 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 32 [2024-10-11 20:55:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:17,909 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2024-10-11 20:55:17,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2024-10-11 20:55:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 20:55:17,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:17,910 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:17,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:55:18,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:55:18,111 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:18,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash -611904844, now seen corresponding path program 1 times [2024-10-11 20:55:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:18,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284492072] [2024-10-11 20:55:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:55:18,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186345628] [2024-10-11 20:55:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:18,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:18,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:55:18,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:55:18,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:55:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:18,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:55:18,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:55:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:18,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:55:18,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:18,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284492072] [2024-10-11 20:55:18,267 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:55:18,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186345628] [2024-10-11 20:55:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186345628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:18,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:55:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454713524] [2024-10-11 20:55:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:18,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:55:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:18,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:55:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:55:18,269 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:18,357 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2024-10-11 20:55:18,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:55:18,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-11 20:55:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:18,359 INFO L225 Difference]: With dead ends: 123 [2024-10-11 20:55:18,359 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 20:55:18,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11 20:55:18,360 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:18,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:55:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 20:55:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 20:55:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 100 states have internal predecessors, (117), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:55:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2024-10-11 20:55:18,378 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 33 [2024-10-11 20:55:18,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:18,378 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2024-10-11 20:55:18,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2024-10-11 20:55:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:55:18,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:18,386 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:18,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:55:18,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:55:18,587 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:18,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2061126728, now seen corresponding path program 1 times [2024-10-11 20:55:18,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:18,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927296389] [2024-10-11 20:55:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:18,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:55:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:55:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:18,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:55:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:55:18,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:18,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927296389] [2024-10-11 20:55:18,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927296389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:18,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:55:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125366756] [2024-10-11 20:55:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:18,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:55:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:18,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:55:18,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:55:18,626 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:18,656 INFO L93 Difference]: Finished difference Result 194 states and 235 transitions. [2024-10-11 20:55:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:55:18,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-11 20:55:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:18,657 INFO L225 Difference]: With dead ends: 194 [2024-10-11 20:55:18,658 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 20:55:18,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:55:18,658 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 10 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:18,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 280 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:55:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 20:55:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2024-10-11 20:55:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 104 states have internal predecessors, (122), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:55:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2024-10-11 20:55:18,664 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 35 [2024-10-11 20:55:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:18,665 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2024-10-11 20:55:18,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2024-10-11 20:55:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 20:55:18,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:18,666 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:18,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:55:18,666 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:18,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:18,666 INFO L85 PathProgramCache]: Analyzing trace with hash 529580956, now seen corresponding path program 1 times [2024-10-11 20:55:18,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:18,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945038806] [2024-10-11 20:55:18,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:18,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:55:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:18,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:55:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:18,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:55:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:18,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:18,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945038806] [2024-10-11 20:55:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945038806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:55:18,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649031375] [2024-10-11 20:55:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:18,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:18,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:55:18,748 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:55:18,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:55:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:18,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:55:18,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:55:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:18,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:55:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:55:18,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649031375] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:55:18,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:55:18,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2024-10-11 20:55:18,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15987647] [2024-10-11 20:55:18,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:55:18,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:55:18,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:18,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:55:18,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:55:18,909 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 20:55:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:19,034 INFO L93 Difference]: Finished difference Result 169 states and 199 transitions. [2024-10-11 20:55:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:55:19,034 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 36 [2024-10-11 20:55:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:19,035 INFO L225 Difference]: With dead ends: 169 [2024-10-11 20:55:19,035 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 20:55:19,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:55:19,036 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 81 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:19,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 622 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:55:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 20:55:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 150. [2024-10-11 20:55:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 110 states have (on average 1.518181818181818) internal successors, (167), 133 states have internal predecessors, (167), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:55:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 191 transitions. [2024-10-11 20:55:19,042 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 191 transitions. Word has length 36 [2024-10-11 20:55:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:19,043 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 191 transitions. [2024-10-11 20:55:19,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 20:55:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 191 transitions. [2024-10-11 20:55:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:55:19,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:19,043 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-11 20:55:19,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:55:19,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:55:19,244 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:19,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:19,245 INFO L85 PathProgramCache]: Analyzing trace with hash -357659521, now seen corresponding path program 1 times [2024-10-11 20:55:19,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:19,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949295922] [2024-10-11 20:55:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:19,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:55:19,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867471564] [2024-10-11 20:55:19,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:19,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:19,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:55:19,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:55:19,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:55:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:19,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:55:19,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:55:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:55:19,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:55:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949295922] [2024-10-11 20:55:19,376 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:55:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867471564] [2024-10-11 20:55:19,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867471564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:55:19,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:55:19,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:55:19,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844057229] [2024-10-11 20:55:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:55:19,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:55:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:55:19,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:55:19,378 INFO L87 Difference]: Start difference. First operand 150 states and 191 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:19,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:19,419 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2024-10-11 20:55:19,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:55:19,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-10-11 20:55:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:19,421 INFO L225 Difference]: With dead ends: 162 [2024-10-11 20:55:19,421 INFO L226 Difference]: Without dead ends: 152 [2024-10-11 20:55:19,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-11 20:55:19,421 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:19,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 93 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:55:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-11 20:55:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 143. [2024-10-11 20:55:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 126 states have internal predecessors, (153), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:55:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 177 transitions. [2024-10-11 20:55:19,429 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 177 transitions. Word has length 41 [2024-10-11 20:55:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:19,429 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 177 transitions. [2024-10-11 20:55:19,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:55:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2024-10-11 20:55:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:55:19,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:55:19,431 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:19,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:55:19,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:19,632 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-11 20:55:19,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:55:19,635 INFO L85 PathProgramCache]: Analyzing trace with hash -911870819, now seen corresponding path program 1 times [2024-10-11 20:55:19,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:55:19,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586223465] [2024-10-11 20:55:19,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:19,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:55:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:19,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:55:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:19,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:55:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:19,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:55:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:19,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:55:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:19,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 20:55:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:55:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:55:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586223465] [2024-10-11 20:55:19,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586223465] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:55:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422300668] [2024-10-11 20:55:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:55:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:55:19,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:55:19,732 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:55:19,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:55:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:55:19,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:55:19,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:55:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:55:19,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:55:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:55:19,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422300668] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:55:19,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:55:19,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2024-10-11 20:55:19,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966093058] [2024-10-11 20:55:19,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:55:19,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:55:19,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:55:19,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:55:19,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:55:19,856 INFO L87 Difference]: Start difference. First operand 143 states and 177 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 20:55:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:55:19,886 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2024-10-11 20:55:19,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:55:19,886 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 44 [2024-10-11 20:55:19,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:55:19,886 INFO L225 Difference]: With dead ends: 147 [2024-10-11 20:55:19,886 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:55:19,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:55:19,887 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:55:19,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 48 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:55:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:55:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:55:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:55:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:55:19,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-10-11 20:55:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:55:19,888 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:55:19,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 20:55:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:55:19,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:55:19,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2024-10-11 20:55:19,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2024-10-11 20:55:19,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2024-10-11 20:55:19,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2024-10-11 20:55:19,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2024-10-11 20:55:19,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2024-10-11 20:55:19,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2024-10-11 20:55:19,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2024-10-11 20:55:19,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2024-10-11 20:55:19,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2024-10-11 20:55:19,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2024-10-11 20:55:19,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2024-10-11 20:55:19,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2024-10-11 20:55:19,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2024-10-11 20:55:19,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2024-10-11 20:55:19,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2024-10-11 20:55:19,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2024-10-11 20:55:19,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2024-10-11 20:55:19,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2024-10-11 20:55:19,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2024-10-11 20:55:19,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2024-10-11 20:55:19,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2024-10-11 20:55:19,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2024-10-11 20:55:19,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2024-10-11 20:55:19,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2024-10-11 20:55:19,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2024-10-11 20:55:19,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2024-10-11 20:55:19,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2024-10-11 20:55:19,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:55:20,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 20:55:20,098 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:55:20,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:55:20,191 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:55:20,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:55:20 BoogieIcfgContainer [2024-10-11 20:55:20,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:55:20,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:55:20,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:55:20,203 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:55:20,205 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:55:14" (3/4) ... [2024-10-11 20:55:20,206 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:55:20,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:55:20,213 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 20:55:20,214 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 20:55:20,214 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:55:20,214 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:55:20,292 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:55:20,294 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:55:20,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:55:20,294 INFO L158 Benchmark]: Toolchain (without parser) took 6109.58ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 97.7MB in the beginning and 141.6MB in the end (delta: -43.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-10-11 20:55:20,294 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:55:20,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.54ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 135.9MB in the end (delta: -38.3MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-10-11 20:55:20,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.62ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 139.8MB in the end (delta: -3.9MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2024-10-11 20:55:20,295 INFO L158 Benchmark]: Boogie Preprocessor took 28.91ms. Allocated memory is still 167.8MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:55:20,295 INFO L158 Benchmark]: RCFGBuilder took 385.69ms. Allocated memory is still 167.8MB. Free memory was 137.7MB in the beginning and 117.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 20:55:20,296 INFO L158 Benchmark]: TraceAbstraction took 5348.40ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 116.8MB in the beginning and 146.8MB in the end (delta: -30.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-10-11 20:55:20,296 INFO L158 Benchmark]: Witness Printer took 90.70ms. Allocated memory is still 216.0MB. Free memory was 146.8MB in the beginning and 141.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:55:20,297 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.54ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 135.9MB in the end (delta: -38.3MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.62ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 139.8MB in the end (delta: -3.9MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.91ms. Allocated memory is still 167.8MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.69ms. Allocated memory is still 167.8MB. Free memory was 137.7MB in the beginning and 117.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5348.40ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 116.8MB in the beginning and 146.8MB in the end (delta: -30.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Witness Printer took 90.70ms. Allocated memory is still 216.0MB. Free memory was 146.8MB in the beginning and 141.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 3342 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2264 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 705 IncrementalHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 1078 mSDtfsCounter, 705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 387 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=14, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 110 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 651 ConstructedInterpolants, 0 QuantifiedInterpolants, 1711 SizeOfPredicates, 11 NumberOfNonLiveVariables, 678 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 350/367 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((0 <= r) && (r <= 4294967295)) && (q == 0)) && (counter == 1)) && (0 <= d)) || (((((((p == 1) && (d <= 4294967295)) && (0 <= r)) && (r <= 4294967295)) && (q == 0)) && (counter == 0)) && (0 <= d))) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((0 <= r) && (r <= 4294967295)) && (q == 0)) && (counter == 2)) && (0 <= d)) || ((((((p == 1) && (d <= 4294967295)) && (0 <= r)) && (q == 0)) && (counter == 1)) && (((__int128) r + 1) <= d))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:55:20,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Writing output log to file Ultimate.log Result: TRUE