./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf6b5d6ce0125c606cfafa6fb4e25513c25265a3f4d4cd63094ae1ba72acdc4a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:26:59,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:26:59,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:26:59,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:26:59,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:26:59,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:26:59,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:26:59,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:26:59,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:26:59,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:26:59,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:26:59,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:26:59,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:26:59,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:26:59,431 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:26:59,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:26:59,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:26:59,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:26:59,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:26:59,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:26:59,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:26:59,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:26:59,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:26:59,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:26:59,434 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:26:59,434 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:26:59,434 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:26:59,434 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:26:59,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:26:59,435 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:26:59,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:26:59,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:26:59,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:26:59,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:26:59,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:26:59,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:26:59,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:26:59,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:26:59,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:26:59,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:26:59,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:26:59,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:26:59,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:26:59,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:26:59,439 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf6b5d6ce0125c606cfafa6fb4e25513c25265a3f4d4cd63094ae1ba72acdc4a [2024-11-10 19:26:59,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:26:59,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:26:59,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:26:59,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:26:59,675 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:26:59,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c [2024-11-10 19:27:00,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:27:01,091 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:27:01,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c [2024-11-10 19:27:01,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbff80dfe/8a9f61c902b54c27b23dd60891aca0db/FLAG8e6dda96b [2024-11-10 19:27:01,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbff80dfe/8a9f61c902b54c27b23dd60891aca0db [2024-11-10 19:27:01,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:27:01,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:27:01,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:27:01,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:27:01,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:27:01,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@972382c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01, skipping insertion in model container [2024-11-10 19:27:01,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:27:01,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:27:01,717 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:27:01,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:27:01,743 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:27:01,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01 WrapperNode [2024-11-10 19:27:01,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:27:01,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:27:01,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:27:01,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:27:01,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,768 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-11-10 19:27:01,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:27:01,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:27:01,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:27:01,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:27:01,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,789 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 19:27:01,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:27:01,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:27:01,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:27:01,798 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:27:01,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (1/1) ... [2024-11-10 19:27:01,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:27:01,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:27:01,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 19:27:01,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 19:27:01,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:27:01,899 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:27:01,899 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:27:01,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:27:01,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:27:01,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:27:01,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:27:01,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:27:01,950 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:27:01,951 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:27:02,137 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-10 19:27:02,137 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:27:02,150 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:27:02,151 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:27:02,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:27:02 BoogieIcfgContainer [2024-11-10 19:27:02,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:27:02,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:27:02,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:27:02,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:27:02,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:27:01" (1/3) ... [2024-11-10 19:27:02,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d0511e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:27:02, skipping insertion in model container [2024-11-10 19:27:02,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:01" (2/3) ... [2024-11-10 19:27:02,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d0511e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:27:02, skipping insertion in model container [2024-11-10 19:27:02,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:27:02" (3/3) ... [2024-11-10 19:27:02,160 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound1.c [2024-11-10 19:27:02,173 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:27:02,173 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-10 19:27:02,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:27:02,224 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;@7bda163b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:27:02,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 19:27:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 39 states have (on average 1.564102564102564) internal successors, (61), 55 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:27:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 19:27:02,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:02,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:02,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:02,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:02,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2058423889, now seen corresponding path program 1 times [2024-11-10 19:27:02,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:02,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45781718] [2024-11-10 19:27:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:27:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:02,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:27:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:27:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:27:02,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:02,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45781718] [2024-11-10 19:27:02,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45781718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:27:02,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:27:02,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:27:02,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287439537] [2024-11-10 19:27:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:27:02,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 19:27:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 19:27:02,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:27:02,391 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.564102564102564) internal successors, (61), 55 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:27:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:02,409 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2024-11-10 19:27:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 19:27:02,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-10 19:27:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:02,415 INFO L225 Difference]: With dead ends: 122 [2024-11-10 19:27:02,416 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 19:27:02,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:27:02,420 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:02,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:27:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 19:27:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 19:27:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.5) internal successors, (51), 49 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:27:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2024-11-10 19:27:02,450 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 21 [2024-11-10 19:27:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:02,450 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2024-11-10 19:27:02,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:27:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2024-11-10 19:27:02,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 19:27:02,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:02,452 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:02,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:27:02,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:02,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:02,453 INFO L85 PathProgramCache]: Analyzing trace with hash -593854542, now seen corresponding path program 1 times [2024-11-10 19:27:02,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:02,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056853533] [2024-11-10 19:27:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:27:02,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180831062] [2024-11-10 19:27:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:02,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:27:02,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:27:02,486 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:27:02,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 19:27:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:02,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 19:27:02,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:27:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 19:27:02,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:27:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:02,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056853533] [2024-11-10 19:27:02,848 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:27:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180831062] [2024-11-10 19:27:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180831062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:27:02,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:27:02,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-10 19:27:02,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489829599] [2024-11-10 19:27:02,849 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:27:02,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:27:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:27:02,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:27:02,853 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:27:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:03,042 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2024-11-10 19:27:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:27:03,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-10 19:27:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:03,044 INFO L225 Difference]: With dead ends: 87 [2024-11-10 19:27:03,044 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 19:27:03,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-10 19:27:03,045 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 88 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:03,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 85 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:27:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 19:27:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-10 19:27:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 65 states have internal predecessors, (75), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:27:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2024-11-10 19:27:03,059 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 22 [2024-11-10 19:27:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:03,060 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2024-11-10 19:27:03,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:27:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2024-11-10 19:27:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 19:27:03,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:03,062 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:03,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 19:27:03,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:27:03,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:03,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:03,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1229621607, now seen corresponding path program 1 times [2024-11-10 19:27:03,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:03,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795529511] [2024-11-10 19:27:03,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:03,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:27:03,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330758769] [2024-11-10 19:27:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:03,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:27:03,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:27:03,295 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:27:03,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 19:27:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:03,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 19:27:03,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:27:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:27:03,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:27:03,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:03,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795529511] [2024-11-10 19:27:03,431 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:27:03,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330758769] [2024-11-10 19:27:03,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330758769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:27:03,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:27:03,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:27:03,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169348107] [2024-11-10 19:27:03,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:27:03,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:27:03,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:03,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:27:03,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:27:03,433 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-11-10 19:27:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:03,552 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2024-11-10 19:27:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:27:03,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) Word has length 23 [2024-11-10 19:27:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:03,554 INFO L225 Difference]: With dead ends: 116 [2024-11-10 19:27:03,555 INFO L226 Difference]: Without dead ends: 67 [2024-11-10 19:27:03,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:27:03,556 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 70 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:03,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 118 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:27:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-10 19:27:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-11-10 19:27:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 58 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:27:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-11-10 19:27:03,577 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 23 [2024-11-10 19:27:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:03,577 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-10 19:27:03,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-11-10 19:27:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2024-11-10 19:27:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 19:27:03,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:03,578 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:03,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 19:27:03,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 19:27:03,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:03,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash 536435856, now seen corresponding path program 1 times [2024-11-10 19:27:03,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:03,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712349924] [2024-11-10 19:27:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:03,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:03,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:27:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:03,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:27:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:03,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:27:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:27:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712349924] [2024-11-10 19:27:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712349924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:27:03,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:27:03,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:27:03,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983197207] [2024-11-10 19:27:03,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:27:03,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:27:03,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:03,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:27:03,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:27:03,887 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:27:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:04,022 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2024-11-10 19:27:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:27:04,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-11-10 19:27:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:04,023 INFO L225 Difference]: With dead ends: 67 [2024-11-10 19:27:04,023 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 19:27:04,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:27:04,024 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:04,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 104 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:27:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 19:27:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-10 19:27:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:27:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-11-10 19:27:04,030 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 24 [2024-11-10 19:27:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:04,030 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-11-10 19:27:04,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:27:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-11-10 19:27:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 19:27:04,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:04,031 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:04,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:27:04,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:04,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash -550357641, now seen corresponding path program 1 times [2024-11-10 19:27:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:04,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732931554] [2024-11-10 19:27:04,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:27:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:27:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:27:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:27:04,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:04,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732931554] [2024-11-10 19:27:04,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732931554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:27:04,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:27:04,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:27:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30031479] [2024-11-10 19:27:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:27:04,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:27:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:04,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:27:04,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:27:04,210 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:27:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:04,407 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-11-10 19:27:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:27:04,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-10 19:27:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:04,408 INFO L225 Difference]: With dead ends: 67 [2024-11-10 19:27:04,408 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 19:27:04,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:27:04,409 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:04,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 106 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:27:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 19:27:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-10 19:27:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 58 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:27:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-10 19:27:04,415 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 25 [2024-11-10 19:27:04,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:04,415 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-10 19:27:04,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:27:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-10 19:27:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 19:27:04,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:04,416 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:04,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 19:27:04,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:04,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1696187594, now seen corresponding path program 1 times [2024-11-10 19:27:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:04,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104824346] [2024-11-10 19:27:04,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:27:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:27:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:27:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:27:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:27:04,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:04,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104824346] [2024-11-10 19:27:04,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104824346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:27:04,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:27:04,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:27:04,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518578753] [2024-11-10 19:27:04,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:27:04,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:27:04,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:04,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:27:04,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:27:04,528 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:27:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:04,575 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-10 19:27:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:27:04,575 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-11-10 19:27:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:04,576 INFO L225 Difference]: With dead ends: 67 [2024-11-10 19:27:04,576 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 19:27:04,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-10 19:27:04,577 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 84 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-11-10 19:27:04,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 84 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:27:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 19:27:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-10 19:27:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.297872340425532) internal successors, (61), 58 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:27:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-11-10 19:27:04,588 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 35 [2024-11-10 19:27:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:04,591 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-11-10 19:27:04,591 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:27:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-11-10 19:27:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 19:27:04,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:04,592 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:04,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 19:27:04,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:04,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1042207856, now seen corresponding path program 1 times [2024-11-10 19:27:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:04,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222160035] [2024-11-10 19:27:04,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:04,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:27:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:27:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:27:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:27:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:27:04,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:04,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222160035] [2024-11-10 19:27:04,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222160035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:27:04,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:27:04,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:27:04,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612522914] [2024-11-10 19:27:04,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:27:04,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:27:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:04,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:27:04,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:27:04,673 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:27:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:04,723 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-11-10 19:27:04,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:27:04,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-10 19:27:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:04,725 INFO L225 Difference]: With dead ends: 67 [2024-11-10 19:27:04,725 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 19:27:04,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-10 19:27:04,725 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 50 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 85 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-11-10 19:27:04,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 85 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:27:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 19:27:04,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-10 19:27:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 58 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:27:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-11-10 19:27:04,732 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 36 [2024-11-10 19:27:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:04,733 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-11-10 19:27:04,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:27:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-11-10 19:27:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 19:27:04,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:04,734 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:04,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 19:27:04,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:04,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1723697893, now seen corresponding path program 1 times [2024-11-10 19:27:04,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:04,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110967135] [2024-11-10 19:27:04,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:04,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:27:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:27:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:27:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:27:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:27:04,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:04,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110967135] [2024-11-10 19:27:04,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110967135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:27:04,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:27:04,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:27:04,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296923946] [2024-11-10 19:27:04,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:27:04,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:27:04,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:04,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:27:04,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:27:04,811 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:27:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:04,850 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-11-10 19:27:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:27:04,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-10 19:27:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:04,852 INFO L225 Difference]: With dead ends: 71 [2024-11-10 19:27:04,852 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 19:27:04,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-10 19:27:04,854 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 58 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:04,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 81 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:27:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 19:27:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-10 19:27:04,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 60 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:27:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-11-10 19:27:04,864 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 41 [2024-11-10 19:27:04,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:04,864 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-11-10 19:27:04,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:27:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-11-10 19:27:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 19:27:04,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:04,867 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:04,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 19:27:04,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:04,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:04,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1895027115, now seen corresponding path program 1 times [2024-11-10 19:27:04,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:04,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717525115] [2024-11-10 19:27:04,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:04,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:27:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:27:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:27:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:27:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:27:04,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:04,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717525115] [2024-11-10 19:27:04,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717525115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:27:04,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:27:04,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:27:04,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31341448] [2024-11-10 19:27:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:27:04,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:27:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:04,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:27:04,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:27:04,961 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:27:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:04,998 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-10 19:27:04,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:27:04,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-11-10 19:27:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:05,000 INFO L225 Difference]: With dead ends: 71 [2024-11-10 19:27:05,000 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 19:27:05,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-10 19:27:05,002 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 56 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 82 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:05,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 82 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:27:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 19:27:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-11-10 19:27:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.26) internal successors, (63), 61 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:27:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-10 19:27:05,009 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 42 [2024-11-10 19:27:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:05,009 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-10 19:27:05,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:27:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-10 19:27:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 19:27:05,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:05,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:05,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 19:27:05,010 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:05,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:05,011 INFO L85 PathProgramCache]: Analyzing trace with hash 54923465, now seen corresponding path program 1 times [2024-11-10 19:27:05,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:05,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795238634] [2024-11-10 19:27:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:05,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:27:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:05,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:27:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:05,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:27:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:05,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:27:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:05,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:27:05,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795238634] [2024-11-10 19:27:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795238634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:27:05,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:27:05,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:27:05,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919192872] [2024-11-10 19:27:05,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:27:05,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:27:05,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:05,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:27:05,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:27:05,072 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:27:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:05,167 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-11-10 19:27:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:27:05,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2024-11-10 19:27:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:05,168 INFO L225 Difference]: With dead ends: 77 [2024-11-10 19:27:05,169 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 19:27:05,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-11-10 19:27:05,170 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:05,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 79 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:27:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 19:27:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2024-11-10 19:27:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.22) internal successors, (61), 59 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:27:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-11-10 19:27:05,174 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2024-11-10 19:27:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:05,175 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-11-10 19:27:05,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:27:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-11-10 19:27:05,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 19:27:05,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:05,175 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:05,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 19:27:05,176 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:05,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:05,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1702627394, now seen corresponding path program 1 times [2024-11-10 19:27:05,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:05,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504697338] [2024-11-10 19:27:05,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:05,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:05,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:27:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:05,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:27:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:05,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:27:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:27:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:27:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:05,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504697338] [2024-11-10 19:27:05,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504697338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:27:05,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:27:05,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:27:05,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4828870] [2024-11-10 19:27:05,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:27:05,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:27:05,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:05,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:27:05,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:27:05,288 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:27:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:05,345 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-11-10 19:27:05,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:27:05,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-11-10 19:27:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:05,346 INFO L225 Difference]: With dead ends: 67 [2024-11-10 19:27:05,346 INFO L226 Difference]: Without dead ends: 65 [2024-11-10 19:27:05,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:27:05,346 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 61 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:05,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 86 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:27:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-10 19:27:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-10 19:27:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.18) internal successors, (59), 57 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:27:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-11-10 19:27:05,355 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 45 [2024-11-10 19:27:05,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:05,355 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-11-10 19:27:05,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:27:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-11-10 19:27:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 19:27:05,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:05,357 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:05,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 19:27:05,358 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:05,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:05,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1143973658, now seen corresponding path program 1 times [2024-11-10 19:27:05,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:05,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387431365] [2024-11-10 19:27:05,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:05,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:27:05,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557126908] [2024-11-10 19:27:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:05,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:27:05,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:27:05,383 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:27:05,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 19:27:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:05,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 19:27:05,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:27:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 19:27:05,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:27:07,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387431365] [2024-11-10 19:27:07,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:27:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557126908] [2024-11-10 19:27:07,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557126908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:27:07,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:27:07,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-10 19:27:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028196789] [2024-11-10 19:27:07,918 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:27:07,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 19:27:07,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:07,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 19:27:07,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-11-10 19:27:07,919 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:27:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:08,098 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2024-11-10 19:27:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 19:27:08,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2024-11-10 19:27:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:08,099 INFO L225 Difference]: With dead ends: 85 [2024-11-10 19:27:08,099 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 19:27:08,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-11-10 19:27:08,100 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 58 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:08,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 105 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:27:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 19:27:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-10 19:27:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:27:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2024-11-10 19:27:08,104 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 49 [2024-11-10 19:27:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:08,104 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2024-11-10 19:27:08,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:27:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2024-11-10 19:27:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 19:27:08,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:08,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:08,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 19:27:08,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:27:08,306 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:08,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash 152942788, now seen corresponding path program 1 times [2024-11-10 19:27:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:08,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864546976] [2024-11-10 19:27:08,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:08,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:27:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:08,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:27:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:08,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:27:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:08,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:27:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 19:27:08,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:08,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864546976] [2024-11-10 19:27:08,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864546976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:27:08,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415243246] [2024-11-10 19:27:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:08,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:27:08,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:27:08,441 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:27:08,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 19:27:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:08,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 19:27:08,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:27:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 19:27:08,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:27:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 19:27:08,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415243246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:27:08,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:27:08,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-10 19:27:08,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700126601] [2024-11-10 19:27:08,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:27:08,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 19:27:08,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:08,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 19:27:08,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:27:08,716 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 13 states have internal predecessors, (74), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-10 19:27:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:08,870 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-11-10 19:27:08,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:27:08,870 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 13 states have internal predecessors, (74), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 51 [2024-11-10 19:27:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:08,870 INFO L225 Difference]: With dead ends: 46 [2024-11-10 19:27:08,871 INFO L226 Difference]: Without dead ends: 45 [2024-11-10 19:27:08,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-10 19:27:08,871 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:08,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 140 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:27:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-10 19:27:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-10 19:27:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.0) internal successors, (38), 38 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:27:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-11-10 19:27:08,876 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 51 [2024-11-10 19:27:08,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:08,877 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-11-10 19:27:08,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 13 states have internal predecessors, (74), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-10 19:27:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-11-10 19:27:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 19:27:08,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:27:08,879 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:08,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 19:27:09,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:27:09,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 19:27:09,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:27:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash 446259139, now seen corresponding path program 1 times [2024-11-10 19:27:09,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:27:09,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188800798] [2024-11-10 19:27:09,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:09,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:27:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:27:09,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073798057] [2024-11-10 19:27:09,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:27:09,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:27:09,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:27:09,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:27:09,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 19:27:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:27:09,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 19:27:09,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:27:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 19:27:09,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:27:34,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:27:34,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188800798] [2024-11-10 19:27:34,089 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:27:34,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073798057] [2024-11-10 19:27:34,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073798057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:27:34,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:27:34,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-10 19:27:34,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441697669] [2024-11-10 19:27:34,089 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:27:34,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 19:27:34,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:27:34,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 19:27:34,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=159, Unknown=6, NotChecked=0, Total=210 [2024-11-10 19:27:34,090 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:27:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:27:34,246 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-11-10 19:27:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 19:27:34,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2024-11-10 19:27:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:27:34,247 INFO L225 Difference]: With dead ends: 45 [2024-11-10 19:27:34,247 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:27:34,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=83, Invalid=253, Unknown=6, NotChecked=0, Total=342 [2024-11-10 19:27:34,248 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:27:34,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 105 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:27:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:27:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:27:34,249 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-11-10 19:27:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:27:34,249 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-11-10 19:27:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:27:34,249 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:27:34,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 19:27:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:27:34,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:27:34,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-11-10 19:27:34,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-11-10 19:27:34,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-11-10 19:27:34,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-11-10 19:27:34,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-11-10 19:27:34,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-11-10 19:27:34,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-11-10 19:27:34,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-11-10 19:27:34,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-11-10 19:27:34,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-11-10 19:27:34,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-11-10 19:27:34,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-11-10 19:27:34,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-11-10 19:27:34,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-11-10 19:27:34,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-11-10 19:27:34,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-11-10 19:27:34,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 19:27:34,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-10 19:27:34,457 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:27:34,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:27:34,558 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:27:34,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:27:34 BoogieIcfgContainer [2024-11-10 19:27:34,577 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:27:34,578 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:27:34,578 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:27:34,578 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:27:34,578 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:27:02" (3/4) ... [2024-11-10 19:27:34,580 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 19:27:34,583 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 19:27:34,583 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 19:27:34,588 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-10 19:27:34,588 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 19:27:34,589 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 19:27:34,589 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 19:27:34,660 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:27:34,661 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 19:27:34,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:27:34,661 INFO L158 Benchmark]: Toolchain (without parser) took 33151.47ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 116.5MB in the beginning and 125.6MB in the end (delta: -9.1MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-11-10 19:27:34,661 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:27:34,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.47ms. Allocated memory is still 184.5MB. Free memory was 116.3MB in the beginning and 103.9MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 19:27:34,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.33ms. Allocated memory is still 184.5MB. Free memory was 103.9MB in the beginning and 102.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:27:34,662 INFO L158 Benchmark]: Boogie Preprocessor took 26.90ms. Allocated memory is still 184.5MB. Free memory was 102.4MB in the beginning and 100.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:27:34,662 INFO L158 Benchmark]: IcfgBuilder took 356.29ms. Allocated memory is still 184.5MB. Free memory was 100.9MB in the beginning and 142.5MB in the end (delta: -41.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-10 19:27:34,662 INFO L158 Benchmark]: TraceAbstraction took 32422.48ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 142.5MB in the beginning and 130.8MB in the end (delta: 11.7MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2024-11-10 19:27:34,663 INFO L158 Benchmark]: Witness Printer took 83.29ms. Allocated memory is still 222.3MB. Free memory was 130.8MB in the beginning and 125.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 19:27:34,663 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.47ms. Allocated memory is still 184.5MB. Free memory was 116.3MB in the beginning and 103.9MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.33ms. Allocated memory is still 184.5MB. Free memory was 103.9MB in the beginning and 102.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.90ms. Allocated memory is still 184.5MB. Free memory was 102.4MB in the beginning and 100.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 356.29ms. Allocated memory is still 184.5MB. Free memory was 100.9MB in the beginning and 142.5MB in the end (delta: -41.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32422.48ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 142.5MB in the beginning and 130.8MB in the end (delta: 11.7MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * Witness Printer took 83.29ms. Allocated memory is still 222.3MB. Free memory was 130.8MB in the beginning and 125.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: 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 3 procedures, 63 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 32.3s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 670 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 662 mSDsluCounter, 1326 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 834 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1122 IncrementalHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 492 mSDtfsCounter, 1122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 322 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 26.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=2, InterpolantAutomatonStates: 81, 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, 14 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 707 NumberOfCodeBlocks, 707 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 2686 SizeOfPredicates, 13 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 159/216 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 16 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 9]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-10 19:27:34,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE