./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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/fermat2-ll_unwindbound2.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 2e2cde485588a76ffd9007a3156c09bf9b7ea2f13bf08ca050cf52c24b8b1e9f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:45:37,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:45:37,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:45:37,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:45:37,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:45:37,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:45:37,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:45:37,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:45:37,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:45:37,170 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:45:37,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:45:37,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:45:37,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:45:37,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:45:37,174 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:45:37,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:45:37,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:45:37,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:45:37,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:45:37,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:45:37,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:45:37,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:45:37,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:45:37,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:45:37,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:45:37,180 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:45:37,181 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:45:37,181 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:45:37,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:45:37,181 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:45:37,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:45:37,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:45:37,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:45:37,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:45:37,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:45:37,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:45:37,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:45:37,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:45:37,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:45:37,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:45:37,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:45:37,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:45:37,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:45:37,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:45:37,186 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 -> 2e2cde485588a76ffd9007a3156c09bf9b7ea2f13bf08ca050cf52c24b8b1e9f [2024-11-09 11:45:37,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:45:37,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:45:37,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:45:37,519 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:45:37,520 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:45:37,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound2.c [2024-11-09 11:45:38,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:45:39,166 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:45:39,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound2.c [2024-11-09 11:45:39,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2141259b2/4e5079d6cec642bf894768873efa2797/FLAG1dd2410f2 [2024-11-09 11:45:39,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2141259b2/4e5079d6cec642bf894768873efa2797 [2024-11-09 11:45:39,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:45:39,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:45:39,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:45:39,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:45:39,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:45:39,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4256a9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39, skipping insertion in model container [2024-11-09 11:45:39,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:45:39,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:45:39,801 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:45:39,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:45:39,841 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:45:39,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39 WrapperNode [2024-11-09 11:45:39,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:45:39,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:45:39,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:45:39,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:45:39,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,901 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2024-11-09 11:45:39,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:45:39,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:45:39,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:45:39,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:45:39,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,943 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-09 11:45:39,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:45:39,968 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:45:39,968 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:45:39,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:45:39,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (1/1) ... [2024-11-09 11:45:39,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:45:39,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:40,016 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-09 11:45:40,020 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-09 11:45:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:45:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 11:45:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 11:45:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:45:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:45:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:45:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:45:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:45:40,135 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:45:40,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:45:40,598 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-09 11:45:40,599 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:45:40,623 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:45:40,624 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:45:40,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:45:40 BoogieIcfgContainer [2024-11-09 11:45:40,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:45:40,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:45:40,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:45:40,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:45:40,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:45:39" (1/3) ... [2024-11-09 11:45:40,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133d2288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:45:40, skipping insertion in model container [2024-11-09 11:45:40,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:39" (2/3) ... [2024-11-09 11:45:40,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133d2288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:45:40, skipping insertion in model container [2024-11-09 11:45:40,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:45:40" (3/3) ... [2024-11-09 11:45:40,635 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound2.c [2024-11-09 11:45:40,650 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:45:40,650 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-11-09 11:45:40,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:45:40,721 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;@77830db1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:45:40,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-11-09 11:45:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 133 states have internal predecessors, (139), 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-09 11:45:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 11:45:40,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:40,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 11:45:40,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:40,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:40,735 INFO L85 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2024-11-09 11:45:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:40,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825504492] [2024-11-09 11:45:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:40,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:45:40,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:40,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825504492] [2024-11-09 11:45:40,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825504492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:40,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:40,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:40,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347022965] [2024-11-09 11:45:40,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:40,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:40,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:40,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:40,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:40,951 INFO L87 Difference]: Start difference. First operand has 140 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 133 states have internal predecessors, (139), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 11:45:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:41,044 INFO L93 Difference]: Finished difference Result 257 states and 281 transitions. [2024-11-09 11:45:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:41,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 11:45:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:41,054 INFO L225 Difference]: With dead ends: 257 [2024-11-09 11:45:41,054 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 11:45:41,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:41,063 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 13 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:41,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 218 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 11:45:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 11:45:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.7142857142857142) internal successors, (120), 117 states have internal predecessors, (120), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2024-11-09 11:45:41,114 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 3 [2024-11-09 11:45:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:41,115 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2024-11-09 11:45:41,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 11:45:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2024-11-09 11:45:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 11:45:41,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:41,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 11:45:41,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:45:41,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:41,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2024-11-09 11:45:41,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:41,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537398880] [2024-11-09 11:45:41,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:45:41,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537398880] [2024-11-09 11:45:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537398880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:41,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:41,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:41,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015017385] [2024-11-09 11:45:41,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:41,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:41,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:41,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:41,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:41,178 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:45:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:41,226 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2024-11-09 11:45:41,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:41,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 11:45:41,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:41,228 INFO L225 Difference]: With dead ends: 123 [2024-11-09 11:45:41,228 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 11:45:41,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:41,230 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:41,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 205 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 11:45:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 11:45:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 113 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2024-11-09 11:45:41,247 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 4 [2024-11-09 11:45:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:41,247 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2024-11-09 11:45:41,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:45:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2024-11-09 11:45:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 11:45:41,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:41,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:41,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:45:41,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:41,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash 87858952, now seen corresponding path program 1 times [2024-11-09 11:45:41,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:41,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890089891] [2024-11-09 11:45:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:41,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:45:41,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1574142856] [2024-11-09 11:45:41,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:41,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:41,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:41,280 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-09 11:45:41,281 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-09 11:45:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:41,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:45:41,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:45:41,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:45:41,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890089891] [2024-11-09 11:45:41,405 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:45:41,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574142856] [2024-11-09 11:45:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574142856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:41,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:41,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135546083] [2024-11-09 11:45:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:41,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:41,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:41,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:41,410 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:45:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:41,463 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2024-11-09 11:45:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:41,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 11:45:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:41,464 INFO L225 Difference]: With dead ends: 119 [2024-11-09 11:45:41,465 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 11:45:41,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:41,466 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:41,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 205 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 11:45:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 11:45:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 111 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2024-11-09 11:45:41,481 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 8 [2024-11-09 11:45:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:41,481 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2024-11-09 11:45:41,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:45:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2024-11-09 11:45:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 11:45:41,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:41,483 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:41,495 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-09 11:45:41,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:41,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:41,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1367701482, now seen corresponding path program 1 times [2024-11-09 11:45:41,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:41,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552957830] [2024-11-09 11:45:41,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:41,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:45:41,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172152824] [2024-11-09 11:45:41,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:41,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:41,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:41,732 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-09 11:45:41,740 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-09 11:45:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:41,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 11:45:41,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:41,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:45:41,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:41,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552957830] [2024-11-09 11:45:41,850 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:45:41,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172152824] [2024-11-09 11:45:41,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172152824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:41,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:41,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130506074] [2024-11-09 11:45:41,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:41,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:41,858 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:41,934 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2024-11-09 11:45:41,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:41,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-09 11:45:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:41,937 INFO L225 Difference]: With dead ends: 117 [2024-11-09 11:45:41,937 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 11:45:41,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:41,941 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 86 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:41,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 114 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 11:45:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 11:45:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.6) internal successors, (112), 109 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2024-11-09 11:45:41,959 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 25 [2024-11-09 11:45:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:41,962 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2024-11-09 11:45:41,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2024-11-09 11:45:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:45:41,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:41,964 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:41,977 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-09 11:45:42,164 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,SelfDestructingSolverStorable3 [2024-11-09 11:45:42,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:42,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash -550926956, now seen corresponding path program 1 times [2024-11-09 11:45:42,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:42,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649588587] [2024-11-09 11:45:42,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:42,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:42,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:42,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:42,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:42,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649588587] [2024-11-09 11:45:42,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649588587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:42,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991334752] [2024-11-09 11:45:42,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:42,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:42,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:42,493 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-09 11:45:42,495 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-09 11:45:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:42,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:45:42,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:42,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:45:42,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991334752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:42,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:45:42,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 11:45:42,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947223122] [2024-11-09 11:45:42,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:42,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:45:42,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:42,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:45:42,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:45:42,890 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:42,984 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2024-11-09 11:45:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:45:42,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 11:45:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:42,986 INFO L225 Difference]: With dead ends: 115 [2024-11-09 11:45:42,987 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 11:45:42,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:45:42,988 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 85 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:42,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 389 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 11:45:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 11:45:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 107 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2024-11-09 11:45:43,002 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 26 [2024-11-09 11:45:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:43,002 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2024-11-09 11:45:43,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2024-11-09 11:45:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 11:45:43,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:43,004 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:43,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:45:43,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:43,205 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:43,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1159825162, now seen corresponding path program 1 times [2024-11-09 11:45:43,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:43,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161970094] [2024-11-09 11:45:43,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:43,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:43,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161970094] [2024-11-09 11:45:43,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161970094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:43,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:43,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:45:43,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286162776] [2024-11-09 11:45:43,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:43,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:45:43,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:43,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:45:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:43,304 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:43,323 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2024-11-09 11:45:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:45:43,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-09 11:45:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:43,325 INFO L225 Difference]: With dead ends: 113 [2024-11-09 11:45:43,325 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 11:45:43,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 11:45:43,326 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:43,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 217 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 11:45:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 11:45:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 106 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2024-11-09 11:45:43,338 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 28 [2024-11-09 11:45:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:43,338 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2024-11-09 11:45:43,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2024-11-09 11:45:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 11:45:43,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:43,339 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:43,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:45:43,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1594841583, now seen corresponding path program 1 times [2024-11-09 11:45:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983940985] [2024-11-09 11:45:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:43,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:43,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:43,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983940985] [2024-11-09 11:45:43,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983940985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:43,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:43,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:45:43,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97800811] [2024-11-09 11:45:43,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:43,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:45:43,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:45:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:43,399 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:43,423 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2024-11-09 11:45:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:45:43,424 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-09 11:45:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:43,425 INFO L225 Difference]: With dead ends: 145 [2024-11-09 11:45:43,425 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 11:45:43,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 11:45:43,426 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 8 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:43,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 308 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 11:45:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 11:45:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 74 states have (on average 1.527027027027027) internal successors, (113), 110 states have internal predecessors, (113), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2024-11-09 11:45:43,433 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 29 [2024-11-09 11:45:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:43,433 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2024-11-09 11:45:43,433 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2024-11-09 11:45:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 11:45:43,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:43,434 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:43,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:45:43,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:43,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash 660565843, now seen corresponding path program 1 times [2024-11-09 11:45:43,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:43,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322138891] [2024-11-09 11:45:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:43,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:43,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322138891] [2024-11-09 11:45:43,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322138891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:43,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:43,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:43,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467854021] [2024-11-09 11:45:43,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:43,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:43,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:43,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:43,500 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:43,538 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2024-11-09 11:45:43,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:43,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-09 11:45:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:43,540 INFO L225 Difference]: With dead ends: 118 [2024-11-09 11:45:43,540 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 11:45:43,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:43,541 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 35 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 159 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-09 11:45:43,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 159 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 11:45:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 11:45:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 75 states have (on average 1.52) internal successors, (114), 111 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2024-11-09 11:45:43,554 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 31 [2024-11-09 11:45:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:43,555 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2024-11-09 11:45:43,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2024-11-09 11:45:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 11:45:43,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:43,556 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:43,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:45:43,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:43,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash -997295267, now seen corresponding path program 1 times [2024-11-09 11:45:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:43,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182546997] [2024-11-09 11:45:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:43,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:43,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182546997] [2024-11-09 11:45:43,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182546997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:43,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:43,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:45:43,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380401897] [2024-11-09 11:45:43,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:43,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:45:43,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:43,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:45:43,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:43,628 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:43,704 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2024-11-09 11:45:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:45:43,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-09 11:45:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:43,706 INFO L225 Difference]: With dead ends: 119 [2024-11-09 11:45:43,706 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 11:45:43,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:43,707 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 45 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:43,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 214 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 11:45:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 11:45:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.513157894736842) internal successors, (115), 112 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2024-11-09 11:45:43,712 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 32 [2024-11-09 11:45:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:43,713 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2024-11-09 11:45:43,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2024-11-09 11:45:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 11:45:43,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:43,714 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:43,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:45:43,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:43,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:43,714 INFO L85 PathProgramCache]: Analyzing trace with hash -851382123, now seen corresponding path program 1 times [2024-11-09 11:45:43,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:43,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11830634] [2024-11-09 11:45:43,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:43,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:45:43,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585082945] [2024-11-09 11:45:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:43,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:43,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:43,729 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-09 11:45:43,741 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-09 11:45:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:43,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 11:45:43,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:43,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:45:43,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:43,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11830634] [2024-11-09 11:45:43,835 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:45:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585082945] [2024-11-09 11:45:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585082945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:43,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:43,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540162646] [2024-11-09 11:45:43,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:43,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:43,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:43,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:43,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:43,837 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:43,898 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2024-11-09 11:45:43,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:43,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-09 11:45:43,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:43,901 INFO L225 Difference]: With dead ends: 154 [2024-11-09 11:45:43,901 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 11:45:43,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:43,902 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 33 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:43,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 188 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 11:45:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2024-11-09 11:45:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 113 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2024-11-09 11:45:43,911 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 33 [2024-11-09 11:45:43,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:43,912 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2024-11-09 11:45:43,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2024-11-09 11:45:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 11:45:43,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:43,916 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:43,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:45:44,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:44,117 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:44,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:44,117 INFO L85 PathProgramCache]: Analyzing trace with hash -623041953, now seen corresponding path program 1 times [2024-11-09 11:45:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:44,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335141946] [2024-11-09 11:45:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:44,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:44,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:44,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:44,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:44,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335141946] [2024-11-09 11:45:44,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335141946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:44,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276280407] [2024-11-09 11:45:44,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:44,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:44,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:44,279 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-09 11:45:44,281 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-09 11:45:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:44,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:45:44,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:44,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:45:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:44,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276280407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:45:44,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:45:44,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-09 11:45:44,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072953749] [2024-11-09 11:45:44,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:45:44,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:45:44,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:44,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:45:44,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:45:44,794 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:45,030 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2024-11-09 11:45:45,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:45:45,031 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-09 11:45:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:45,033 INFO L225 Difference]: With dead ends: 154 [2024-11-09 11:45:45,033 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 11:45:45,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:45:45,034 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 217 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:45,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 573 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:45:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 11:45:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 120. [2024-11-09 11:45:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.5) internal successors, (117), 114 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2024-11-09 11:45:45,041 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 34 [2024-11-09 11:45:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:45,041 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2024-11-09 11:45:45,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2024-11-09 11:45:45,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 11:45:45,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:45,044 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:45,061 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-09 11:45:45,247 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,SelfDestructingSolverStorable10 [2024-11-09 11:45:45,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:45,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1742859935, now seen corresponding path program 1 times [2024-11-09 11:45:45,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:45,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423847690] [2024-11-09 11:45:45,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:45,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:45:45,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [251728063] [2024-11-09 11:45:45,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:45,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:45,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:45,262 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:45,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:45:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:45,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:45:45,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:45,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:45:45,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:45,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423847690] [2024-11-09 11:45:45,616 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:45:45,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251728063] [2024-11-09 11:45:45,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251728063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:45,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:45:45,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-09 11:45:45,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773706643] [2024-11-09 11:45:45,617 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:45:45,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:45:45,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:45,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:45:45,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:45:45,618 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:45:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:46,965 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2024-11-09 11:45:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:45:46,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-09 11:45:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:46,967 INFO L225 Difference]: With dead ends: 198 [2024-11-09 11:45:46,967 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 11:45:46,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:45:46,968 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 217 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:46,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 303 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 11:45:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 11:45:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2024-11-09 11:45:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 125 states have (on average 1.512) internal successors, (189), 161 states have internal predecessors, (189), 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-09 11:45:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 197 transitions. [2024-11-09 11:45:46,985 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 197 transitions. Word has length 36 [2024-11-09 11:45:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:46,986 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 197 transitions. [2024-11-09 11:45:46,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:45:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 197 transitions. [2024-11-09 11:45:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 11:45:46,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:46,987 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:47,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:45:47,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:47,187 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:47,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash 148850787, now seen corresponding path program 1 times [2024-11-09 11:45:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:47,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075681208] [2024-11-09 11:45:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:47,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:45:47,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925044539] [2024-11-09 11:45:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:47,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:47,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:47,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:47,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:45:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:47,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:45:47,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:47,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:45:47,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075681208] [2024-11-09 11:45:47,265 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:45:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925044539] [2024-11-09 11:45:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925044539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:47,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:47,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:47,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977232587] [2024-11-09 11:45:47,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:47,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:47,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:47,290 INFO L87 Difference]: Start difference. First operand 168 states and 197 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:47,392 INFO L93 Difference]: Finished difference Result 286 states and 346 transitions. [2024-11-09 11:45:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:47,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-09 11:45:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:47,395 INFO L225 Difference]: With dead ends: 286 [2024-11-09 11:45:47,395 INFO L226 Difference]: Without dead ends: 257 [2024-11-09 11:45:47,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:47,396 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 53 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:47,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 148 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-09 11:45:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 241. [2024-11-09 11:45:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 196 states have (on average 1.4795918367346939) internal successors, (290), 232 states have internal predecessors, (290), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 302 transitions. [2024-11-09 11:45:47,409 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 302 transitions. Word has length 38 [2024-11-09 11:45:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:47,409 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 302 transitions. [2024-11-09 11:45:47,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 302 transitions. [2024-11-09 11:45:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 11:45:47,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:47,410 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:47,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:45:47,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:47,611 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:47,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash -671097975, now seen corresponding path program 1 times [2024-11-09 11:45:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:47,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941732369] [2024-11-09 11:45:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:47,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:47,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:47,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:47,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:47,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:47,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941732369] [2024-11-09 11:45:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941732369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:47,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:47,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:45:47,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203480352] [2024-11-09 11:45:47,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:47,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:45:47,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:47,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:45:47,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:45:47,695 INFO L87 Difference]: Start difference. First operand 241 states and 302 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:47,823 INFO L93 Difference]: Finished difference Result 241 states and 302 transitions. [2024-11-09 11:45:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:45:47,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2024-11-09 11:45:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:47,825 INFO L225 Difference]: With dead ends: 241 [2024-11-09 11:45:47,825 INFO L226 Difference]: Without dead ends: 240 [2024-11-09 11:45:47,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:45:47,826 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 118 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:47,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 188 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-09 11:45:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-09 11:45:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 196 states have (on average 1.4591836734693877) internal successors, (286), 231 states have internal predecessors, (286), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 298 transitions. [2024-11-09 11:45:47,839 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 298 transitions. Word has length 56 [2024-11-09 11:45:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:47,839 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 298 transitions. [2024-11-09 11:45:47,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 298 transitions. [2024-11-09 11:45:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 11:45:47,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:47,841 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:47,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 11:45:47,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:47,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash -671098295, now seen corresponding path program 1 times [2024-11-09 11:45:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:47,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017915280] [2024-11-09 11:45:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:47,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:47,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:47,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017915280] [2024-11-09 11:45:47,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017915280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:47,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:47,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:45:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679452587] [2024-11-09 11:45:47,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:47,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:45:47,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:47,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:45:47,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:47,915 INFO L87 Difference]: Start difference. First operand 240 states and 298 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:48,047 INFO L93 Difference]: Finished difference Result 256 states and 299 transitions. [2024-11-09 11:45:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:45:48,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2024-11-09 11:45:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:48,049 INFO L225 Difference]: With dead ends: 256 [2024-11-09 11:45:48,049 INFO L226 Difference]: Without dead ends: 255 [2024-11-09 11:45:48,050 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-09 11:45:48,051 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:48,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 197 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-09 11:45:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2024-11-09 11:45:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 196 states have (on average 1.4489795918367347) internal successors, (284), 231 states have internal predecessors, (284), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 296 transitions. [2024-11-09 11:45:48,064 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 296 transitions. Word has length 56 [2024-11-09 11:45:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:48,065 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 296 transitions. [2024-11-09 11:45:48,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 296 transitions. [2024-11-09 11:45:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 11:45:48,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:48,067 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:48,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 11:45:48,067 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:48,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:48,068 INFO L85 PathProgramCache]: Analyzing trace with hash 670799390, now seen corresponding path program 1 times [2024-11-09 11:45:48,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:48,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62114958] [2024-11-09 11:45:48,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:48,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:48,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:48,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62114958] [2024-11-09 11:45:48,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62114958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:48,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:48,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:45:48,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709072790] [2024-11-09 11:45:48,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:48,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:45:48,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:48,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:45:48,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:48,129 INFO L87 Difference]: Start difference. First operand 240 states and 296 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:48,260 INFO L93 Difference]: Finished difference Result 263 states and 323 transitions. [2024-11-09 11:45:48,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:45:48,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2024-11-09 11:45:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:48,262 INFO L225 Difference]: With dead ends: 263 [2024-11-09 11:45:48,262 INFO L226 Difference]: Without dead ends: 259 [2024-11-09 11:45:48,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-09 11:45:48,263 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 54 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:48,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 191 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-09 11:45:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 234. [2024-11-09 11:45:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.402061855670103) internal successors, (272), 225 states have internal predecessors, (272), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 284 transitions. [2024-11-09 11:45:48,302 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 284 transitions. Word has length 57 [2024-11-09 11:45:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:48,302 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 284 transitions. [2024-11-09 11:45:48,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 284 transitions. [2024-11-09 11:45:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 11:45:48,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:48,304 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:48,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 11:45:48,306 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:48,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:48,307 INFO L85 PathProgramCache]: Analyzing trace with hash 670789460, now seen corresponding path program 1 times [2024-11-09 11:45:48,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:48,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588815182] [2024-11-09 11:45:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:48,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:48,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:48,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588815182] [2024-11-09 11:45:48,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588815182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:48,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:48,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:45:48,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896772927] [2024-11-09 11:45:48,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:48,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:45:48,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:48,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:45:48,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:45:48,411 INFO L87 Difference]: Start difference. First operand 234 states and 284 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:48,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:48,600 INFO L93 Difference]: Finished difference Result 242 states and 285 transitions. [2024-11-09 11:45:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:45:48,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2024-11-09 11:45:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:48,602 INFO L225 Difference]: With dead ends: 242 [2024-11-09 11:45:48,602 INFO L226 Difference]: Without dead ends: 241 [2024-11-09 11:45:48,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:45:48,603 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 138 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:48,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 164 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:45:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-09 11:45:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 234. [2024-11-09 11:45:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.3917525773195876) internal successors, (270), 225 states have internal predecessors, (270), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 282 transitions. [2024-11-09 11:45:48,617 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 282 transitions. Word has length 57 [2024-11-09 11:45:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:48,617 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 282 transitions. [2024-11-09 11:45:48,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 282 transitions. [2024-11-09 11:45:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 11:45:48,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:48,619 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:48,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 11:45:48,619 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:48,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash -825338779, now seen corresponding path program 1 times [2024-11-09 11:45:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:48,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052499944] [2024-11-09 11:45:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:48,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:48,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052499944] [2024-11-09 11:45:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052499944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:48,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681874507] [2024-11-09 11:45:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:48,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:48,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:48,711 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:48,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:45:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:48,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:45:48,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:48,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:45:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:48,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681874507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:45:48,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:45:48,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2024-11-09 11:45:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881388971] [2024-11-09 11:45:48,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:45:48,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:45:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:48,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:45:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:45:48,933 INFO L87 Difference]: Start difference. First operand 234 states and 282 transitions. Second operand has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 states have internal predecessors, (106), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 11:45:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:49,062 INFO L93 Difference]: Finished difference Result 602 states and 706 transitions. [2024-11-09 11:45:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:45:49,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 states have internal predecessors, (106), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2024-11-09 11:45:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:49,065 INFO L225 Difference]: With dead ends: 602 [2024-11-09 11:45:49,066 INFO L226 Difference]: Without dead ends: 559 [2024-11-09 11:45:49,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:45:49,067 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 224 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:49,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 790 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-09 11:45:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 420. [2024-11-09 11:45:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 372 states have (on average 1.4220430107526882) internal successors, (529), 403 states have internal predecessors, (529), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:45:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 551 transitions. [2024-11-09 11:45:49,093 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 551 transitions. Word has length 62 [2024-11-09 11:45:49,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:49,094 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 551 transitions. [2024-11-09 11:45:49,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 states have internal predecessors, (106), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 11:45:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 551 transitions. [2024-11-09 11:45:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 11:45:49,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:49,095 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:49,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:45:49,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 11:45:49,300 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:49,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1418385575, now seen corresponding path program 1 times [2024-11-09 11:45:49,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:49,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154369373] [2024-11-09 11:45:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:49,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:49,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:49,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:49,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:49,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:49,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154369373] [2024-11-09 11:45:49,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154369373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:49,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:49,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:45:49,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164818033] [2024-11-09 11:45:49,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:49,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:45:49,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:49,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:45:49,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:45:49,388 INFO L87 Difference]: Start difference. First operand 420 states and 551 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:49,564 INFO L93 Difference]: Finished difference Result 481 states and 622 transitions. [2024-11-09 11:45:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:45:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2024-11-09 11:45:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:49,567 INFO L225 Difference]: With dead ends: 481 [2024-11-09 11:45:49,567 INFO L226 Difference]: Without dead ends: 480 [2024-11-09 11:45:49,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:45:49,568 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 96 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:49,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 240 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-09 11:45:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 433. [2024-11-09 11:45:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 385 states have (on average 1.4077922077922078) internal successors, (542), 416 states have internal predecessors, (542), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:45:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 564 transitions. [2024-11-09 11:45:49,594 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 564 transitions. Word has length 64 [2024-11-09 11:45:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:49,595 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 564 transitions. [2024-11-09 11:45:49,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 564 transitions. [2024-11-09 11:45:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 11:45:49,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:49,596 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:49,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 11:45:49,596 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:49,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash -836399119, now seen corresponding path program 1 times [2024-11-09 11:45:49,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:49,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102612033] [2024-11-09 11:45:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:49,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:49,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:49,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:49,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:49,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102612033] [2024-11-09 11:45:49,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102612033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:49,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441296186] [2024-11-09 11:45:49,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:49,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:49,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:49,710 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:49,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:45:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:49,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:45:49,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:49,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:45:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:50,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441296186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:45:50,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:45:50,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-09 11:45:50,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254618586] [2024-11-09 11:45:50,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:45:50,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:45:50,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:50,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:45:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:45:50,048 INFO L87 Difference]: Start difference. First operand 433 states and 564 transitions. Second operand has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 11:45:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:50,772 INFO L93 Difference]: Finished difference Result 583 states and 738 transitions. [2024-11-09 11:45:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:45:50,772 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2024-11-09 11:45:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:50,774 INFO L225 Difference]: With dead ends: 583 [2024-11-09 11:45:50,775 INFO L226 Difference]: Without dead ends: 581 [2024-11-09 11:45:50,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2024-11-09 11:45:50,776 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 597 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:50,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 415 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 11:45:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-09 11:45:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 436. [2024-11-09 11:45:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 389 states have (on average 1.3933161953727506) internal successors, (542), 419 states have internal predecessors, (542), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:45:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 564 transitions. [2024-11-09 11:45:50,802 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 564 transitions. Word has length 64 [2024-11-09 11:45:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:50,802 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 564 transitions. [2024-11-09 11:45:50,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 11:45:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 564 transitions. [2024-11-09 11:45:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 11:45:50,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:50,803 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:50,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 11:45:51,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:51,004 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:51,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1020279945, now seen corresponding path program 1 times [2024-11-09 11:45:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854356374] [2024-11-09 11:45:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:51,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:51,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:51,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:51,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854356374] [2024-11-09 11:45:51,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854356374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:51,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138093268] [2024-11-09 11:45:51,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:51,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:51,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:51,074 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:51,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 11:45:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:51,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:45:51,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:51,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:45:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:51,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138093268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:45:51,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:45:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-09 11:45:51,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559291470] [2024-11-09 11:45:51,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:45:51,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:45:51,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:51,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:45:51,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:45:51,419 INFO L87 Difference]: Start difference. First operand 436 states and 564 transitions. Second operand has 14 states, 13 states have (on average 11.846153846153847) internal successors, (154), 14 states have internal predecessors, (154), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 11:45:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:52,047 INFO L93 Difference]: Finished difference Result 542 states and 697 transitions. [2024-11-09 11:45:52,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 11:45:52,048 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 11.846153846153847) internal successors, (154), 14 states have internal predecessors, (154), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 65 [2024-11-09 11:45:52,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:52,051 INFO L225 Difference]: With dead ends: 542 [2024-11-09 11:45:52,051 INFO L226 Difference]: Without dead ends: 540 [2024-11-09 11:45:52,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-09 11:45:52,052 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 242 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:52,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 359 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 11:45:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-09 11:45:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 448. [2024-11-09 11:45:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 401 states have (on average 1.371571072319202) internal successors, (550), 431 states have internal predecessors, (550), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:45:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 572 transitions. [2024-11-09 11:45:52,081 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 572 transitions. Word has length 65 [2024-11-09 11:45:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:52,081 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 572 transitions. [2024-11-09 11:45:52,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 11.846153846153847) internal successors, (154), 14 states have internal predecessors, (154), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 11:45:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 572 transitions. [2024-11-09 11:45:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 11:45:52,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:52,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:52,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 11:45:52,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 11:45:52,287 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:52,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:52,287 INFO L85 PathProgramCache]: Analyzing trace with hash -158568833, now seen corresponding path program 1 times [2024-11-09 11:45:52,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:52,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839681567] [2024-11-09 11:45:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:52,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:52,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:52,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:52,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:52,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839681567] [2024-11-09 11:45:52,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839681567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:52,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341594964] [2024-11-09 11:45:52,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:52,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:52,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:52,380 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:52,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 11:45:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:52,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:45:52,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:46:05,717 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_45| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_45| |v_ULTIMATE.start_main_~R~0#1_45|))) (and (<= .cse0 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0)))) is different from true [2024-11-09 11:46:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2024-11-09 11:46:05,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:46:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:46:05,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341594964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:46:05,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:46:05,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-09 11:46:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885051567] [2024-11-09 11:46:05,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:46:05,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:46:05,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:46:05,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:46:05,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=4, NotChecked=22, Total=182 [2024-11-09 11:46:05,913 INFO L87 Difference]: Start difference. First operand 448 states and 572 transitions. Second operand has 14 states, 13 states have (on average 10.307692307692308) internal successors, (134), 14 states have internal predecessors, (134), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 11:46:09,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:13,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:17,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:22,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:36,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:40,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:49,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:51,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:55,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:59,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:47:14,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:47:18,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]