./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/prodbin-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/prodbin-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 8cecbb1437ef2a2416e9d468bf4de8fbbd7da1f76f2f86e847aa165ffb35626c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:01:53,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:01:53,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:01:53,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:01:53,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:01:53,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:01:53,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:01:53,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:01:53,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:01:53,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:01:53,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:01:53,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:01:53,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:01:53,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:01:53,692 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:01:53,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:01:53,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:01:53,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:01:53,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:01:53,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:01:53,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:01:53,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:01:53,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:01:53,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:01:53,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:01:53,696 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:01:53,696 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:01:53,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:01:53,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:01:53,696 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:01:53,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:01:53,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:01:53,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:01:53,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:01:53,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:01:53,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:01:53,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:01:53,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:01:53,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:01:53,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:01:53,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:01:53,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:01:53,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:01:53,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:01:53,702 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 -> 8cecbb1437ef2a2416e9d468bf4de8fbbd7da1f76f2f86e847aa165ffb35626c [2024-10-11 21:01:53,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:01:53,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:01:53,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:01:53,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:01:53,960 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:01:53,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound1.c [2024-10-11 21:01:55,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:01:55,594 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:01:55,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound1.c [2024-10-11 21:01:55,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/75cdd8dbb/df1c0a14d6734d228add30fd3639edce/FLAG2f965e67a [2024-10-11 21:01:55,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/75cdd8dbb/df1c0a14d6734d228add30fd3639edce [2024-10-11 21:01:55,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:01:55,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:01:55,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:01:55,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:01:55,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:01:55,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a520e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55, skipping insertion in model container [2024-10-11 21:01:55,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:01:55,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:01:55,871 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:01:55,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:01:55,901 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:01:55,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55 WrapperNode [2024-10-11 21:01:55,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:01:55,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:01:55,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:01:55,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:01:55,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,933 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-10-11 21:01:55,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:01:55,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:01:55,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:01:55,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:01:55,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,955 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 21:01:55,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:01:55,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:01:55,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:01:55,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:01:55,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (1/1) ... [2024-10-11 21:01:55,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:01:55,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:01:56,003 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 21:01:56,009 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 21:01:56,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:01:56,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:01:56,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:01:56,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:01:56,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 21:01:56,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 21:01:56,107 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:01:56,109 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:01:56,297 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-11 21:01:56,298 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:01:56,337 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:01:56,337 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 21:01:56,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:01:56 BoogieIcfgContainer [2024-10-11 21:01:56,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:01:56,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:01:56,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:01:56,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:01:56,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:01:55" (1/3) ... [2024-10-11 21:01:56,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f51b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:01:56, skipping insertion in model container [2024-10-11 21:01:56,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:55" (2/3) ... [2024-10-11 21:01:56,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f51b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:01:56, skipping insertion in model container [2024-10-11 21:01:56,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:01:56" (3/3) ... [2024-10-11 21:01:56,350 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound1.c [2024-10-11 21:01:56,365 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:01:56,366 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-10-11 21:01:56,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:01:56,440 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;@459f4a60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:01:56,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-10-11 21:01:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 47 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:01:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 21:01:56,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:56,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 21:01:56,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:56,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:56,459 INFO L85 PathProgramCache]: Analyzing trace with hash 114676290, now seen corresponding path program 1 times [2024-10-11 21:01:56,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:56,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098703449] [2024-10-11 21:01:56,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:56,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:56,603 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 21:01:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:56,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098703449] [2024-10-11 21:01:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098703449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:56,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:01:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:01:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963853727] [2024-10-11 21:01:56,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:56,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 21:01:56,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 21:01:56,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:01:56,635 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 47 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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 21:01:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:56,677 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2024-10-11 21:01:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 21:01:56,683 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 21:01:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:56,696 INFO L225 Difference]: With dead ends: 100 [2024-10-11 21:01:56,696 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 21:01:56,699 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 21:01:56,722 INFO L432 NwaCegarLoop]: 52 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, 52 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 21:01:56,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:01:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 21:01:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 21:01:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 45 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-10-11 21:01:56,764 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 5 [2024-10-11 21:01:56,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:56,765 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-10-11 21:01:56,765 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 21:01:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-10-11 21:01:56,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 21:01:56,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:56,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 21:01:56,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:01:56,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:56,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash 114734239, now seen corresponding path program 1 times [2024-10-11 21:01:56,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56675966] [2024-10-11 21:01:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:56,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:56,906 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 21:01:56,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:56,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56675966] [2024-10-11 21:01:56,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56675966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:56,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:01:56,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:01:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913229820] [2024-10-11 21:01:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:56,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:01:56,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:56,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:01:56,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:01:56,909 INFO L87 Difference]: Start difference. First operand 48 states and 50 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 21:01:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:56,963 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2024-10-11 21:01:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:01:56,964 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 21:01:56,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:56,965 INFO L225 Difference]: With dead ends: 58 [2024-10-11 21:01:56,967 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 21:01:56,967 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 21:01:56,968 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:01:56,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 131 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:01:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 21:01:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 21:01:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.625) internal successors, (52), 49 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2024-10-11 21:01:56,977 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 5 [2024-10-11 21:01:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:56,977 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2024-10-11 21:01:56,977 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 21:01:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2024-10-11 21:01:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 21:01:56,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:56,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:01:56,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:01:56,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:56,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash -746205741, now seen corresponding path program 1 times [2024-10-11 21:01:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:56,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592053397] [2024-10-11 21:01:56,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:56,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:01:57,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104907357] [2024-10-11 21:01:57,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:57,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:01:57,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:01:57,011 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 21:01:57,012 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 21:01:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:57,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:01:57,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:01:57,257 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 21:01:57,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:01:57,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:57,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592053397] [2024-10-11 21:01:57,259 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:01:57,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104907357] [2024-10-11 21:01:57,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104907357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:57,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:01:57,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:01:57,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628301670] [2024-10-11 21:01:57,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:57,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:01:57,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:57,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:01:57,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:01:57,263 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:01:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:57,422 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2024-10-11 21:01:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:01:57,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 21:01:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:57,423 INFO L225 Difference]: With dead ends: 75 [2024-10-11 21:01:57,423 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 21:01:57,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:01:57,425 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 78 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:01:57,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 57 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:01:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 21:01:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-11 21:01:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 60 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:01:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2024-10-11 21:01:57,441 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 8 [2024-10-11 21:01:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:57,441 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2024-10-11 21:01:57,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:01:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2024-10-11 21:01:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 21:01:57,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:57,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:01:57,460 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 21:01:57,642 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 21:01:57,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:57,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:57,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1657541434, now seen corresponding path program 1 times [2024-10-11 21:01:57,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:57,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963113187] [2024-10-11 21:01:57,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:57,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:01:57,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34463316] [2024-10-11 21:01:57,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:57,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:01:57,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:01:57,658 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 21:01:57,661 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 21:01:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:57,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:01:57,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:01:57,844 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 21:01:57,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:01:57,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:57,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963113187] [2024-10-11 21:01:57,845 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:01:57,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34463316] [2024-10-11 21:01:57,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34463316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:57,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:01:57,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:01:57,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137976460] [2024-10-11 21:01:57,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:57,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:01:57,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:57,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:01:57,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:01:57,850 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:01:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:57,970 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2024-10-11 21:01:57,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:01:57,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 21:01:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:57,971 INFO L225 Difference]: With dead ends: 67 [2024-10-11 21:01:57,971 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 21:01:57,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 21:01:57,973 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 74 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:01:57,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:01:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 21:01:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 21:01:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:01:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-10-11 21:01:57,981 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 9 [2024-10-11 21:01:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:57,981 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-10-11 21:01:57,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:01:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-10-11 21:01:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 21:01:57,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:57,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:01:57,998 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 21:01:58,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:01:58,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:58,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash 155823157, now seen corresponding path program 1 times [2024-10-11 21:01:58,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:58,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618079461] [2024-10-11 21:01:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:58,279 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 21:01:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618079461] [2024-10-11 21:01:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618079461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:58,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:01:58,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:01:58,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866434091] [2024-10-11 21:01:58,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:58,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:01:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:58,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:01:58,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:01:58,281 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 21:01:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:58,416 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2024-10-11 21:01:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:01:58,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-10-11 21:01:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:58,418 INFO L225 Difference]: With dead ends: 89 [2024-10-11 21:01:58,418 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 21:01:58,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 21:01:58,419 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:01:58,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 75 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:01:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 21:01:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2024-10-11 21:01:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 73 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:01:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2024-10-11 21:01:58,429 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 10 [2024-10-11 21:01:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:58,430 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2024-10-11 21:01:58,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 21:01:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2024-10-11 21:01:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 21:01:58,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:58,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:01:58,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:01:58,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:58,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash 535550632, now seen corresponding path program 1 times [2024-10-11 21:01:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:58,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698553597] [2024-10-11 21:01:58,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:58,555 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 21:01:58,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:58,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698553597] [2024-10-11 21:01:58,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698553597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:58,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:01:58,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:01:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911643933] [2024-10-11 21:01:58,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:58,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:01:58,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:58,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:01:58,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:01:58,558 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 21:01:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:58,782 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-10-11 21:01:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:01:58,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-10-11 21:01:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:58,783 INFO L225 Difference]: With dead ends: 89 [2024-10-11 21:01:58,783 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 21:01:58,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:01:58,784 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 27 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:01:58,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 70 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:01:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 21:01:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2024-10-11 21:01:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.45) internal successors, (87), 73 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:01:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2024-10-11 21:01:58,797 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 11 [2024-10-11 21:01:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:58,798 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2024-10-11 21:01:58,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 21:01:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2024-10-11 21:01:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 21:01:58,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:58,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:01:58,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:01:58,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:58,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1139810194, now seen corresponding path program 1 times [2024-10-11 21:01:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:58,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655082082] [2024-10-11 21:01:58,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:58,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:01:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:58,917 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 21:01:58,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:58,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655082082] [2024-10-11 21:01:58,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655082082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:58,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:01:58,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:01:58,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532980785] [2024-10-11 21:01:58,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:58,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:01:58,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:58,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:01:58,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:01:58,921 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:58,974 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2024-10-11 21:01:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:01:58,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 21:01:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:58,975 INFO L225 Difference]: With dead ends: 79 [2024-10-11 21:01:58,976 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 21:01:58,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:01:58,977 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 57 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:01:58,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:01:58,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 21:01:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 21:01:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 73 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:01:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2024-10-11 21:01:58,991 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 21 [2024-10-11 21:01:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:58,992 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-10-11 21:01:58,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2024-10-11 21:01:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 21:01:58,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:58,993 INFO L215 NwaCegarLoop]: trace histogram [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 21:01:58,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 21:01:58,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:58,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash 974377724, now seen corresponding path program 1 times [2024-10-11 21:01:58,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:58,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305535386] [2024-10-11 21:01:58,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:58,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:59,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:01:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:59,094 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 21:01:59,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:59,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305535386] [2024-10-11 21:01:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305535386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:59,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:01:59,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:01:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251526540] [2024-10-11 21:01:59,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:59,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:01:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:59,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:01:59,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:01:59,100 INFO L87 Difference]: Start difference. First operand 78 states and 92 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:59,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:59,149 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2024-10-11 21:01:59,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:01:59,149 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 21:01:59,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:59,150 INFO L225 Difference]: With dead ends: 79 [2024-10-11 21:01:59,151 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 21:01:59,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:01:59,152 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:01:59,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 58 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:01:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 21:01:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 21:01:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 73 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:01:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2024-10-11 21:01:59,163 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 22 [2024-10-11 21:01:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:59,164 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2024-10-11 21:01:59,164 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2024-10-11 21:01:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 21:01:59,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:59,165 INFO L215 NwaCegarLoop]: trace histogram [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 21:01:59,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:01:59,165 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:59,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash 141247285, now seen corresponding path program 1 times [2024-10-11 21:01:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:59,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550639484] [2024-10-11 21:01:59,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:59,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:59,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:01:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:59,270 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 21:01:59,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:59,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550639484] [2024-10-11 21:01:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550639484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:59,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:01:59,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:01:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101796619] [2024-10-11 21:01:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:59,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:01:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:01:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:01:59,276 INFO L87 Difference]: Start difference. First operand 78 states and 91 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:59,364 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2024-10-11 21:01:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:01:59,365 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 21:01:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:59,366 INFO L225 Difference]: With dead ends: 83 [2024-10-11 21:01:59,366 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 21:01:59,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 21:01:59,367 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 68 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:01:59,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 45 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:01:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 21:01:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-10-11 21:01:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 72 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:01:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2024-10-11 21:01:59,374 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 23 [2024-10-11 21:01:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:59,374 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2024-10-11 21:01:59,374 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2024-10-11 21:01:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 21:01:59,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:59,375 INFO L215 NwaCegarLoop]: trace histogram [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 21:01:59,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:01:59,375 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:59,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:59,378 INFO L85 PathProgramCache]: Analyzing trace with hash 83698632, now seen corresponding path program 1 times [2024-10-11 21:01:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:59,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398935977] [2024-10-11 21:01:59,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:59,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:01:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:59,478 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 21:01:59,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:59,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398935977] [2024-10-11 21:01:59,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398935977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:59,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:01:59,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:01:59,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870834499] [2024-10-11 21:01:59,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:59,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:01:59,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:59,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:01:59,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:01:59,482 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:59,531 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2024-10-11 21:01:59,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:01:59,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-11 21:01:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:59,532 INFO L225 Difference]: With dead ends: 77 [2024-10-11 21:01:59,533 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 21:01:59,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:01:59,533 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:01:59,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 34 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:01:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 21:01:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-10-11 21:01:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 68 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:01:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2024-10-11 21:01:59,547 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 24 [2024-10-11 21:01:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:59,548 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2024-10-11 21:01:59,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2024-10-11 21:01:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 21:01:59,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:59,548 INFO L215 NwaCegarLoop]: trace histogram [1, 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 21:01:59,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 21:01:59,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:59,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1997098471, now seen corresponding path program 1 times [2024-10-11 21:01:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:59,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209897079] [2024-10-11 21:01:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:01:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:59,599 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 21:01:59,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:59,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209897079] [2024-10-11 21:01:59,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209897079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:59,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:01:59,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:01:59,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868056355] [2024-10-11 21:01:59,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:59,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:01:59,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:01:59,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:01:59,602 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:59,649 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2024-10-11 21:01:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:01:59,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-11 21:01:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:59,650 INFO L225 Difference]: With dead ends: 78 [2024-10-11 21:01:59,650 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 21:01:59,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:01:59,651 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:01:59,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 51 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:01:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 21:01:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-10-11 21:01:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 71 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:01:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-10-11 21:01:59,657 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 25 [2024-10-11 21:01:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:59,658 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-10-11 21:01:59,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2024-10-11 21:01:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 21:01:59,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:59,659 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:01:59,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 21:01:59,659 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:01:59,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:01:59,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1169991862, now seen corresponding path program 1 times [2024-10-11 21:01:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:01:59,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674645981] [2024-10-11 21:01:59,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:59,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:01:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:59,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:01:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:01:59,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:01:59,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674645981] [2024-10-11 21:01:59,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674645981] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:01:59,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349204237] [2024-10-11 21:01:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:01:59,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:01:59,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:01:59,749 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 21:01:59,751 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 21:01:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:01:59,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:01:59,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:01:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:01:59,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:01:59,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349204237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:01:59,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:01:59,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 21:01:59,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024301350] [2024-10-11 21:01:59,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:01:59,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:01:59,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:01:59,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:01:59,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:01:59,857 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:59,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:01:59,877 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2024-10-11 21:01:59,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:01:59,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 21:01:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:01:59,878 INFO L225 Difference]: With dead ends: 76 [2024-10-11 21:01:59,878 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 21:01:59,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 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 21:01:59,879 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:01:59,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 99 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:01:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 21:01:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 21:01:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 70 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:01:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-10-11 21:01:59,885 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 26 [2024-10-11 21:01:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:01:59,885 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-10-11 21:01:59,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:01:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-10-11 21:01:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 21:01:59,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:01:59,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 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 21:01:59,904 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 21:02:00,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:02:00,087 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:02:00,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:02:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1780510368, now seen corresponding path program 1 times [2024-10-11 21:02:00,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:02:00,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308987878] [2024-10-11 21:02:00,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:02:00,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:02:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:02:00,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:02:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:02:00,128 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 21:02:00,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:02:00,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308987878] [2024-10-11 21:02:00,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308987878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:02:00,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:02:00,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:02:00,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630938987] [2024-10-11 21:02:00,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:02:00,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:02:00,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:02:00,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:02:00,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:02:00,130 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:02:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:02:00,177 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2024-10-11 21:02:00,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:02:00,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 21:02:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:02:00,178 INFO L225 Difference]: With dead ends: 77 [2024-10-11 21:02:00,178 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 21:02:00,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:02:00,179 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:02:00,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 50 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:02:00,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 21:02:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 21:02:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 71 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:02:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2024-10-11 21:02:00,184 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 26 [2024-10-11 21:02:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:02:00,185 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2024-10-11 21:02:00,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:02:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2024-10-11 21:02:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 21:02:00,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:02:00,186 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:02:00,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 21:02:00,186 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:02:00,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:02:00,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1910009306, now seen corresponding path program 1 times [2024-10-11 21:02:00,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:02:00,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411023378] [2024-10-11 21:02:00,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:02:00,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:02:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:02:00,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:02:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:02:00,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:02:00,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:02:00,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411023378] [2024-10-11 21:02:00,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411023378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:02:00,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339908492] [2024-10-11 21:02:00,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:02:00,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:02:00,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:02:00,252 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 21:02:00,253 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 21:02:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:02:00,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:02:00,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:02:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:02:00,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:02:00,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339908492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:02:00,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:02:00,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-10-11 21:02:00,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616081284] [2024-10-11 21:02:00,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:02:00,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:02:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:02:00,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:02:00,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:02:00,327 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:02:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:02:00,357 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2024-10-11 21:02:00,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:02:00,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-11 21:02:00,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:02:00,358 INFO L225 Difference]: With dead ends: 76 [2024-10-11 21:02:00,358 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 21:02:00,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 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 21:02:00,359 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:02:00,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 97 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:02:00,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 21:02:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 21:02:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 70 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:02:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2024-10-11 21:02:00,364 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 27 [2024-10-11 21:02:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:02:00,364 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2024-10-11 21:02:00,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:02:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-10-11 21:02:00,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 21:02:00,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:02:00,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 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 21:02:00,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 21:02:00,565 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,SelfDestructingSolverStorable13 [2024-10-11 21:02:00,566 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:02:00,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:02:00,567 INFO L85 PathProgramCache]: Analyzing trace with hash 638753531, now seen corresponding path program 1 times [2024-10-11 21:02:00,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:02:00,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555723994] [2024-10-11 21:02:00,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:02:00,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:02:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:02:00,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:02:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:02:00,628 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 21:02:00,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:02:00,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555723994] [2024-10-11 21:02:00,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555723994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:02:00,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:02:00,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:02:00,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363455391] [2024-10-11 21:02:00,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:02:00,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:02:00,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:02:00,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:02:00,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:02:00,633 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:02:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:02:00,724 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2024-10-11 21:02:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:02:00,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-11 21:02:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:02:00,725 INFO L225 Difference]: With dead ends: 81 [2024-10-11 21:02:00,725 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 21:02:00,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:02:00,726 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 47 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 36 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 21:02:00,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:02:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 21:02:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-10-11 21:02:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 69 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:02:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-10-11 21:02:00,731 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 27 [2024-10-11 21:02:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:02:00,732 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-10-11 21:02:00,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:02:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-10-11 21:02:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 21:02:00,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:02:00,733 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:02:00,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 21:02:00,734 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 21:02:00,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:02:00,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1567905976, now seen corresponding path program 1 times [2024-10-11 21:02:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:02:00,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240201148] [2024-10-11 21:02:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:02:00,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:02:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:02:00,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:02:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:02:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:02:00,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:02:00,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240201148] [2024-10-11 21:02:00,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240201148] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:02:00,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901156946] [2024-10-11 21:02:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:02:00,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:02:00,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:02:00,814 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 21:02:00,815 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 21:02:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:02:00,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:02:00,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:02:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:02:00,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:02:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:02:00,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901156946] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:02:00,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:02:00,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2024-10-11 21:02:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30949044] [2024-10-11 21:02:00,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:02:00,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 21:02:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:02:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 21:02:00,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:02:00,969 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:02:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:02:01,006 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-10-11 21:02:01,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:02:01,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-10-11 21:02:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:02:01,007 INFO L225 Difference]: With dead ends: 90 [2024-10-11 21:02:01,007 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:02:01,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:02:01,008 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 118 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 21:02:01,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 118 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:02:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:02:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:02:01,010 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 21:02:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:02:01,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-10-11 21:02:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:02:01,010 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:02:01,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:02:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:02:01,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:02:01,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2024-10-11 21:02:01,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2024-10-11 21:02:01,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2024-10-11 21:02:01,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2024-10-11 21:02:01,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2024-10-11 21:02:01,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2024-10-11 21:02:01,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2024-10-11 21:02:01,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2024-10-11 21:02:01,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2024-10-11 21:02:01,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2024-10-11 21:02:01,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2024-10-11 21:02:01,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2024-10-11 21:02:01,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2024-10-11 21:02:01,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2024-10-11 21:02:01,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2024-10-11 21:02:01,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2024-10-11 21:02:01,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2024-10-11 21:02:01,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2024-10-11 21:02:01,033 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 21:02:01,217 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,SelfDestructingSolverStorable15 [2024-10-11 21:02:01,220 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 21:02:01,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:02:01,352 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:02:01,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:02:01 BoogieIcfgContainer [2024-10-11 21:02:01,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:02:01,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:02:01,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:02:01,386 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:02:01,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:01:56" (3/4) ... [2024-10-11 21:02:01,388 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:02:01,391 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 21:02:01,396 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 21:02:01,396 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 21:02:01,397 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:02:01,397 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:02:01,484 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:02:01,484 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:02:01,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:02:01,485 INFO L158 Benchmark]: Toolchain (without parser) took 5860.81ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 115.8MB in the beginning and 145.7MB in the end (delta: -29.9MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2024-10-11 21:02:01,485 INFO L158 Benchmark]: CDTParser took 1.58ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:02:01,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.17ms. Allocated memory is still 148.9MB. Free memory was 115.2MB in the beginning and 103.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 21:02:01,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.05ms. Allocated memory is still 148.9MB. Free memory was 103.2MB in the beginning and 101.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:02:01,485 INFO L158 Benchmark]: Boogie Preprocessor took 37.13ms. Allocated memory is still 148.9MB. Free memory was 101.9MB in the beginning and 99.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:02:01,486 INFO L158 Benchmark]: RCFGBuilder took 365.16ms. Allocated memory is still 148.9MB. Free memory was 99.9MB in the beginning and 85.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 21:02:01,486 INFO L158 Benchmark]: TraceAbstraction took 5041.65ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 84.3MB in the beginning and 149.9MB in the end (delta: -65.6MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2024-10-11 21:02:01,486 INFO L158 Benchmark]: Witness Printer took 98.66ms. Allocated memory is still 180.4MB. Free memory was 149.9MB in the beginning and 145.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 21:02:01,487 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.58ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.17ms. Allocated memory is still 148.9MB. Free memory was 115.2MB in the beginning and 103.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.05ms. Allocated memory is still 148.9MB. Free memory was 103.2MB in the beginning and 101.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.13ms. Allocated memory is still 148.9MB. Free memory was 101.9MB in the beginning and 99.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 365.16ms. Allocated memory is still 148.9MB. Free memory was 99.9MB in the beginning and 85.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5041.65ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 84.3MB in the beginning and 149.9MB in the end (delta: -65.6MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Witness Printer took 98.66ms. Allocated memory is still 180.4MB. Free memory was 149.9MB in the beginning and 145.7MB in the end (delta: 4.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: 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: 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: 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: 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: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: 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: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: 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, 51 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 649 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 640 mSDsluCounter, 1091 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 623 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 562 IncrementalHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 468 mSDtfsCounter, 562 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 133 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=5, InterpolantAutomatonStates: 71, 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, 35 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 1536 SizeOfPredicates, 10 NumberOfNonLiveVariables, 308 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 14/25 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 18 specifications checked. All of them hold - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((0 <= (a + 2147483648)) && (a <= 2147483647)) && (1 <= b)) && (b <= 2147483647)) && (0 <= ((__int128) y + 2147483648))) && (counter == 1)) && (y <= 2147483647)) || ((((((((((0 <= (a + 2147483648)) && (a <= 2147483647)) && (1 <= y)) && (x <= 2147483647)) && (0 <= ((__int128) x + 2147483648))) && (1 <= b)) && (b <= 2147483647)) && (counter == 0)) && (z == 0)) && (y <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:02:01,509 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