./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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/fermat1-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 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:40:21,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:40:22,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:40:22,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:40:22,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:40:22,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:40:22,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:40:22,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:40:22,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:40:22,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:40:22,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:40:22,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:40:22,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:40:22,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:40:22,098 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:40:22,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:40:22,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:40:22,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:40:22,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:40:22,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:40:22,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:40:22,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:40:22,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:40:22,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:40:22,106 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:40:22,106 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:40:22,106 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:40:22,106 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:40:22,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:40:22,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:40:22,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:40:22,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:40:22,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:40:22,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:40:22,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:40:22,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:40:22,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:40:22,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:40:22,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:40:22,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:40:22,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:40:22,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:40:22,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:40:22,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:40:22,113 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 -> 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 [2024-11-19 10:40:22,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:40:22,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:40:22,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:40:22,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:40:22,400 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:40:22,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2024-11-19 10:40:23,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:40:24,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:40:24,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2024-11-19 10:40:24,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4542b0a/22c9535b767c4066a4eb42834d8e03b4/FLAG6bfaf3932 [2024-11-19 10:40:24,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4542b0a/22c9535b767c4066a4eb42834d8e03b4 [2024-11-19 10:40:24,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:40:24,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:40:24,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:40:24,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:40:24,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:40:24,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d123f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24, skipping insertion in model container [2024-11-19 10:40:24,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:40:24,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:40:24,799 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:40:24,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:40:24,841 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:40:24,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24 WrapperNode [2024-11-19 10:40:24,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:40:24,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:40:24,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:40:24,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:40:24,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,883 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 172 [2024-11-19 10:40:24,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:40:24,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:40:24,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:40:24,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:40:24,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,908 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-19 10:40:24,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:40:24,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:40:24,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:40:24,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:40:24,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (1/1) ... [2024-11-19 10:40:24,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:40:24,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:24,977 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-19 10:40:24,986 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-19 10:40:25,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:40:25,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 10:40:25,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 10:40:25,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:40:25,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:40:25,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:40:25,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 10:40:25,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 10:40:25,098 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:40:25,102 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:40:25,658 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-19 10:40:25,658 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:40:25,684 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:40:25,684 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 10:40:25,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:40:25 BoogieIcfgContainer [2024-11-19 10:40:25,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:40:25,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:40:25,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:40:25,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:40:25,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:40:24" (1/3) ... [2024-11-19 10:40:25,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1821cacd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:40:25, skipping insertion in model container [2024-11-19 10:40:25,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:40:24" (2/3) ... [2024-11-19 10:40:25,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1821cacd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:40:25, skipping insertion in model container [2024-11-19 10:40:25,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:40:25" (3/3) ... [2024-11-19 10:40:25,694 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound2.c [2024-11-19 10:40:25,711 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:40:25,711 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2024-11-19 10:40:25,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:40:25,782 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;@43d062f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:40:25,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2024-11-19 10:40:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 218 states have internal predecessors, (229), 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-19 10:40:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 10:40:25,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:25,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 10:40:25,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:25,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:25,797 INFO L85 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2024-11-19 10:40:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:25,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319238786] [2024-11-19 10:40:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:25,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:25,960 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-19 10:40:25,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:25,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319238786] [2024-11-19 10:40:25,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319238786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:25,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:25,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:40:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274232643] [2024-11-19 10:40:25,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:25,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:40:25,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:40:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:40:25,990 INFO L87 Difference]: Start difference. First operand has 227 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 218 states have internal predecessors, (229), 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) 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-19 10:40:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:26,082 INFO L93 Difference]: Finished difference Result 427 states and 471 transitions. [2024-11-19 10:40:26,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:40:26,100 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-19 10:40:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:26,108 INFO L225 Difference]: With dead ends: 427 [2024-11-19 10:40:26,108 INFO L226 Difference]: Without dead ends: 206 [2024-11-19 10:40:26,113 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-19 10:40:26,116 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 13 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 394 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.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:26,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 394 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-19 10:40:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-19 10:40:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 115 states have (on average 1.7739130434782608) internal successors, (204), 198 states have internal predecessors, (204), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 10:40:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 214 transitions. [2024-11-19 10:40:26,179 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 214 transitions. Word has length 3 [2024-11-19 10:40:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:26,179 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 214 transitions. [2024-11-19 10:40:26,180 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-19 10:40:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 214 transitions. [2024-11-19 10:40:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 10:40:26,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:26,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 10:40:26,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:40:26,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:26,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2024-11-19 10:40:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564713970] [2024-11-19 10:40:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:26,221 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-19 10:40:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564713970] [2024-11-19 10:40:26,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564713970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:26,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:26,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:40:26,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156108305] [2024-11-19 10:40:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:26,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:40:26,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:26,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:40:26,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:40:26,229 INFO L87 Difference]: Start difference. First operand 206 states and 214 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-19 10:40:26,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:26,289 INFO L93 Difference]: Finished difference Result 206 states and 214 transitions. [2024-11-19 10:40:26,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:40:26,290 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-19 10:40:26,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:26,292 INFO L225 Difference]: With dead ends: 206 [2024-11-19 10:40:26,292 INFO L226 Difference]: Without dead ends: 202 [2024-11-19 10:40:26,293 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-19 10:40:26,294 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 12 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 381 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-19 10:40:26,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-19 10:40:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-19 10:40:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 115 states have (on average 1.7391304347826086) internal successors, (200), 194 states have internal predecessors, (200), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 10:40:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 210 transitions. [2024-11-19 10:40:26,309 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 210 transitions. Word has length 4 [2024-11-19 10:40:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:26,309 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 210 transitions. [2024-11-19 10:40:26,309 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-19 10:40:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 210 transitions. [2024-11-19 10:40:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:40:26,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:26,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:40:26,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:40:26,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:26,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash 87858952, now seen corresponding path program 1 times [2024-11-19 10:40:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:26,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008895156] [2024-11-19 10:40:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:26,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:40:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695691855] [2024-11-19 10:40:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:26,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:26,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:26,341 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-19 10:40:26,342 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-19 10:40:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:26,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:40:26,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:26,450 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-19 10:40:26,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:40:26,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:26,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008895156] [2024-11-19 10:40:26,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:40:26,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695691855] [2024-11-19 10:40:26,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695691855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:26,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:26,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:40:26,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67808235] [2024-11-19 10:40:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:26,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:40:26,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:26,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:40:26,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:40:26,457 INFO L87 Difference]: Start difference. First operand 202 states and 210 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-19 10:40:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:26,510 INFO L93 Difference]: Finished difference Result 202 states and 210 transitions. [2024-11-19 10:40:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:40:26,511 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-19 10:40:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:26,513 INFO L225 Difference]: With dead ends: 202 [2024-11-19 10:40:26,515 INFO L226 Difference]: Without dead ends: 200 [2024-11-19 10:40:26,516 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-19 10:40:26,517 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 8 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 381 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-19 10:40:26,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 381 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-19 10:40:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-19 10:40:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 115 states have (on average 1.7217391304347827) internal successors, (198), 192 states have internal predecessors, (198), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 10:40:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 208 transitions. [2024-11-19 10:40:26,535 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 208 transitions. Word has length 8 [2024-11-19 10:40:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:26,535 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 208 transitions. [2024-11-19 10:40:26,536 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-19 10:40:26,536 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 208 transitions. [2024-11-19 10:40:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 10:40:26,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:26,537 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-19 10:40:26,552 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-19 10:40:26,741 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-19 10:40:26,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1897916790, now seen corresponding path program 1 times [2024-11-19 10:40:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990895602] [2024-11-19 10:40:26,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:40:26,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1419876934] [2024-11-19 10:40:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:26,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:26,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:26,775 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-19 10:40:26,780 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-19 10:40:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:26,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 10:40:26,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:26,896 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-19 10:40:26,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:40:26,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:26,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990895602] [2024-11-19 10:40:26,897 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:40:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419876934] [2024-11-19 10:40:26,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419876934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:26,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:26,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:40:26,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016380285] [2024-11-19 10:40:26,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:26,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:40:26,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:26,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:40:26,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:40:26,899 INFO L87 Difference]: Start difference. First operand 200 states and 208 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-19 10:40:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:26,954 INFO L93 Difference]: Finished difference Result 200 states and 208 transitions. [2024-11-19 10:40:26,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:40:26,955 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-19 10:40:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:26,956 INFO L225 Difference]: With dead ends: 200 [2024-11-19 10:40:26,958 INFO L226 Difference]: Without dead ends: 198 [2024-11-19 10:40:26,959 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-19 10:40:26,960 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 162 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:26,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 188 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:26,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-19 10:40:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-19 10:40:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 190 states have internal predecessors, (196), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 10:40:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 206 transitions. [2024-11-19 10:40:26,984 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 206 transitions. Word has length 25 [2024-11-19 10:40:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:26,986 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 206 transitions. [2024-11-19 10:40:26,986 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-19 10:40:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 206 transitions. [2024-11-19 10:40:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 10:40:26,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:26,990 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-19 10:40:27,007 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-19 10:40:27,190 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-19 10:40:27,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:27,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:27,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1294121716, now seen corresponding path program 1 times [2024-11-19 10:40:27,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:27,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760885040] [2024-11-19 10:40:27,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:27,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:27,447 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-19 10:40:27,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:27,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760885040] [2024-11-19 10:40:27,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760885040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:40:27,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481081261] [2024-11-19 10:40:27,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:27,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:27,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:27,451 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-19 10:40:27,452 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-19 10:40:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:27,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:40:27,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:28,017 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-19 10:40:28,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:40:28,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481081261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:28,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:40:28,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 10:40:28,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814775334] [2024-11-19 10:40:28,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:28,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:40:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:28,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:40:28,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:40:28,019 INFO L87 Difference]: Start difference. First operand 198 states and 206 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-19 10:40:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:28,151 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2024-11-19 10:40:28,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:40:28,151 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-19 10:40:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:28,153 INFO L225 Difference]: With dead ends: 198 [2024-11-19 10:40:28,153 INFO L226 Difference]: Without dead ends: 196 [2024-11-19 10:40:28,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:40:28,158 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 161 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:28,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 675 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:40:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-19 10:40:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-19 10:40:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 115 states have (on average 1.6869565217391305) internal successors, (194), 188 states have internal predecessors, (194), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 10:40:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 204 transitions. [2024-11-19 10:40:28,171 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 204 transitions. Word has length 26 [2024-11-19 10:40:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:28,171 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 204 transitions. [2024-11-19 10:40:28,172 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-19 10:40:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 204 transitions. [2024-11-19 10:40:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 10:40:28,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:28,173 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-19 10:40:28,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 10:40:28,376 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-19 10:40:28,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:28,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:28,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1889544618, now seen corresponding path program 1 times [2024-11-19 10:40:28,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:28,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438810737] [2024-11-19 10:40:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:28,473 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-19 10:40:28,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:28,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438810737] [2024-11-19 10:40:28,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438810737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:28,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:28,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:40:28,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594690635] [2024-11-19 10:40:28,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:28,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:40:28,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:40:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:40:28,476 INFO L87 Difference]: Start difference. First operand 196 states and 204 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-19 10:40:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:28,518 INFO L93 Difference]: Finished difference Result 275 states and 284 transitions. [2024-11-19 10:40:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:40:28,519 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-19 10:40:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:28,520 INFO L225 Difference]: With dead ends: 275 [2024-11-19 10:40:28,520 INFO L226 Difference]: Without dead ends: 274 [2024-11-19 10:40:28,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-19 10:40:28,521 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 84 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:28,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 567 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-19 10:40:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 223. [2024-11-19 10:40:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.6928571428571428) internal successors, (237), 214 states have internal predecessors, (237), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:40:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2024-11-19 10:40:28,535 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 28 [2024-11-19 10:40:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:28,535 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2024-11-19 10:40:28,536 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-19 10:40:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2024-11-19 10:40:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 10:40:28,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:28,537 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-19 10:40:28,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:40:28,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:28,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1553659057, now seen corresponding path program 1 times [2024-11-19 10:40:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231702954] [2024-11-19 10:40:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:28,618 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-19 10:40:28,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:28,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231702954] [2024-11-19 10:40:28,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231702954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:28,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:28,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:40:28,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396031670] [2024-11-19 10:40:28,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:28,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:40:28,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:28,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:40:28,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:40:28,620 INFO L87 Difference]: Start difference. First operand 223 states and 249 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-19 10:40:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:28,652 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2024-11-19 10:40:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:40:28,653 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-19 10:40:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:28,655 INFO L225 Difference]: With dead ends: 252 [2024-11-19 10:40:28,655 INFO L226 Difference]: Without dead ends: 223 [2024-11-19 10:40:28,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-19 10:40:28,657 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 8 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 570 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-19 10:40:28,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 570 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:28,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-19 10:40:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-11-19 10:40:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.6785714285714286) internal successors, (235), 214 states have internal predecessors, (235), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:40:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 247 transitions. [2024-11-19 10:40:28,666 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 247 transitions. Word has length 29 [2024-11-19 10:40:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:28,666 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 247 transitions. [2024-11-19 10:40:28,666 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-19 10:40:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2024-11-19 10:40:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 10:40:28,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:28,667 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-19 10:40:28,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:40:28,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:28,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1582262797, now seen corresponding path program 1 times [2024-11-19 10:40:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:28,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271061784] [2024-11-19 10:40:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:28,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:28,725 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-19 10:40:28,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:28,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271061784] [2024-11-19 10:40:28,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271061784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:28,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:28,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:40:28,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531436818] [2024-11-19 10:40:28,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:28,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:40:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:28,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:40:28,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:40:28,727 INFO L87 Difference]: Start difference. First operand 223 states and 247 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-19 10:40:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:28,794 INFO L93 Difference]: Finished difference Result 275 states and 301 transitions. [2024-11-19 10:40:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:40:28,797 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-19 10:40:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:28,798 INFO L225 Difference]: With dead ends: 275 [2024-11-19 10:40:28,798 INFO L226 Difference]: Without dead ends: 272 [2024-11-19 10:40:28,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 10:40:28,799 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 141 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:28,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 274 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:40:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-19 10:40:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 238. [2024-11-19 10:40:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 155 states have (on average 1.664516129032258) internal successors, (258), 229 states have internal predecessors, (258), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:40:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2024-11-19 10:40:28,812 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 31 [2024-11-19 10:40:28,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:28,813 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2024-11-19 10:40:28,814 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-19 10:40:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2024-11-19 10:40:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 10:40:28,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:28,815 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-19 10:40:28,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:40:28,816 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:28,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:28,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1805506371, now seen corresponding path program 1 times [2024-11-19 10:40:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:28,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354142690] [2024-11-19 10:40:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:28,877 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-19 10:40:28,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:28,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354142690] [2024-11-19 10:40:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354142690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:28,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:28,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:40:28,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009928702] [2024-11-19 10:40:28,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:28,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:40:28,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:28,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:40:28,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:40:28,879 INFO L87 Difference]: Start difference. First operand 238 states and 270 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-19 10:40:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:28,994 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2024-11-19 10:40:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:40:28,995 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-19 10:40:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:28,996 INFO L225 Difference]: With dead ends: 278 [2024-11-19 10:40:28,996 INFO L226 Difference]: Without dead ends: 275 [2024-11-19 10:40:28,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-19 10:40:28,998 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 151 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:28,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 431 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:40:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-19 10:40:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 241. [2024-11-19 10:40:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 232 states have internal predecessors, (260), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:40:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2024-11-19 10:40:29,013 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 32 [2024-11-19 10:40:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:29,013 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2024-11-19 10:40:29,013 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-19 10:40:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2024-11-19 10:40:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 10:40:29,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:29,014 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-19 10:40:29,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 10:40:29,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:29,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:29,015 INFO L85 PathProgramCache]: Analyzing trace with hash -136122571, now seen corresponding path program 1 times [2024-11-19 10:40:29,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:29,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472046700] [2024-11-19 10:40:29,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:29,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:40:29,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220060842] [2024-11-19 10:40:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:29,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:29,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:29,039 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-19 10:40:29,041 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-19 10:40:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:29,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 10:40:29,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:29,143 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-19 10:40:29,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:40:29,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:29,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472046700] [2024-11-19 10:40:29,144 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:40:29,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220060842] [2024-11-19 10:40:29,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220060842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:29,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:29,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:40:29,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946113021] [2024-11-19 10:40:29,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:29,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:40:29,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:29,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:40:29,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:40:29,147 INFO L87 Difference]: Start difference. First operand 241 states and 272 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-19 10:40:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:29,275 INFO L93 Difference]: Finished difference Result 390 states and 436 transitions. [2024-11-19 10:40:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:40:29,276 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-19 10:40:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:29,278 INFO L225 Difference]: With dead ends: 390 [2024-11-19 10:40:29,279 INFO L226 Difference]: Without dead ends: 387 [2024-11-19 10:40:29,280 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-19 10:40:29,281 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 139 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:29,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 361 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:40:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-19 10:40:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 313. [2024-11-19 10:40:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 227 states have (on average 1.669603524229075) internal successors, (379), 301 states have internal predecessors, (379), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 10:40:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 397 transitions. [2024-11-19 10:40:29,300 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 397 transitions. Word has length 33 [2024-11-19 10:40:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:29,301 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 397 transitions. [2024-11-19 10:40:29,301 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-19 10:40:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 397 transitions. [2024-11-19 10:40:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 10:40:29,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:29,302 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-19 10:40:29,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 10:40:29,502 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-19 10:40:29,503 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:29,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash 75167679, now seen corresponding path program 1 times [2024-11-19 10:40:29,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:29,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677051894] [2024-11-19 10:40:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:29,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:29,635 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-19 10:40:29,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:29,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677051894] [2024-11-19 10:40:29,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677051894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:40:29,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471091217] [2024-11-19 10:40:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:29,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:29,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:29,641 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-19 10:40:29,644 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-19 10:40:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:29,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:40:29,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:29,947 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-19 10:40:29,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:40:30,131 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-19 10:40:30,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471091217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:40:30,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:40:30,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-19 10:40:30,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706938127] [2024-11-19 10:40:30,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:40:30,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 10:40:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:30,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 10:40:30,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:40:30,136 INFO L87 Difference]: Start difference. First operand 313 states and 397 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-19 10:40:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:30,539 INFO L93 Difference]: Finished difference Result 430 states and 471 transitions. [2024-11-19 10:40:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 10:40:30,539 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-19 10:40:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:30,541 INFO L225 Difference]: With dead ends: 430 [2024-11-19 10:40:30,541 INFO L226 Difference]: Without dead ends: 427 [2024-11-19 10:40:30,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 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-19 10:40:30,542 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 689 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:30,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1091 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:40:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-19 10:40:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 319. [2024-11-19 10:40:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 233 states have (on average 1.648068669527897) internal successors, (384), 307 states have internal predecessors, (384), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 10:40:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 402 transitions. [2024-11-19 10:40:30,560 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 402 transitions. Word has length 34 [2024-11-19 10:40:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:30,561 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 402 transitions. [2024-11-19 10:40:30,561 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-19 10:40:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 402 transitions. [2024-11-19 10:40:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 10:40:30,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:30,563 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-19 10:40:30,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 10:40:30,763 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-19 10:40:30,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:30,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash -778301759, now seen corresponding path program 1 times [2024-11-19 10:40:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117127900] [2024-11-19 10:40:30,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:40:30,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004797504] [2024-11-19 10:40:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:30,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:30,777 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-19 10:40:30,779 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-19 10:40:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:30,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:40:30,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:31,020 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-19 10:40:31,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:40:31,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:31,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117127900] [2024-11-19 10:40:31,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:40:31,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004797504] [2024-11-19 10:40:31,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004797504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:40:31,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:40:31,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-19 10:40:31,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91112533] [2024-11-19 10:40:31,139 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 10:40:31,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:40:31,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:31,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:40:31,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:40:31,140 INFO L87 Difference]: Start difference. First operand 319 states and 402 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-19 10:40:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:33,738 INFO L93 Difference]: Finished difference Result 499 states and 616 transitions. [2024-11-19 10:40:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 10:40:33,739 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-19 10:40:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:33,741 INFO L225 Difference]: With dead ends: 499 [2024-11-19 10:40:33,741 INFO L226 Difference]: Without dead ends: 472 [2024-11-19 10:40:33,741 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-19 10:40:33,742 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 428 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:33,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 520 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 10:40:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-19 10:40:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 438. [2024-11-19 10:40:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 349 states have (on average 1.5501432664756447) internal successors, (541), 423 states have internal predecessors, (541), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 10:40:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 565 transitions. [2024-11-19 10:40:33,772 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 565 transitions. Word has length 36 [2024-11-19 10:40:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:33,773 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 565 transitions. [2024-11-19 10:40:33,773 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-19 10:40:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 565 transitions. [2024-11-19 10:40:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 10:40:33,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:33,773 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-19 10:40:33,791 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-19 10:40:33,974 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-19 10:40:33,974 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:33,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:33,975 INFO L85 PathProgramCache]: Analyzing trace with hash -623678013, now seen corresponding path program 1 times [2024-11-19 10:40:33,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:33,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334198001] [2024-11-19 10:40:33,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:33,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:40:33,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967028478] [2024-11-19 10:40:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:33,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:33,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:33,988 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-19 10:40:33,990 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-19 10:40:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:34,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:40:34,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:34,056 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-19 10:40:34,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:40:34,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:34,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334198001] [2024-11-19 10:40:34,058 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:40:34,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967028478] [2024-11-19 10:40:34,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967028478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:34,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:34,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:40:34,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980850683] [2024-11-19 10:40:34,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:34,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:40:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:40:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:40:34,061 INFO L87 Difference]: Start difference. First operand 438 states and 565 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-19 10:40:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:34,282 INFO L93 Difference]: Finished difference Result 630 states and 798 transitions. [2024-11-19 10:40:34,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:40:34,284 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-19 10:40:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:34,287 INFO L225 Difference]: With dead ends: 630 [2024-11-19 10:40:34,288 INFO L226 Difference]: Without dead ends: 589 [2024-11-19 10:40:34,288 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-19 10:40:34,289 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 117 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:34,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 299 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:40:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-19 10:40:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 557. [2024-11-19 10:40:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 465 states have (on average 1.4903225806451612) internal successors, (693), 539 states have internal predecessors, (693), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 10:40:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 723 transitions. [2024-11-19 10:40:34,337 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 723 transitions. Word has length 38 [2024-11-19 10:40:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:34,338 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 723 transitions. [2024-11-19 10:40:34,338 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-19 10:40:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 723 transitions. [2024-11-19 10:40:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 10:40:34,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:34,339 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:40:34,359 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-19 10:40:34,544 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-19 10:40:34,545 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:34,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash 321396954, now seen corresponding path program 1 times [2024-11-19 10:40:34,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057758932] [2024-11-19 10:40:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:34,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:34,633 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-19 10:40:34,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:34,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057758932] [2024-11-19 10:40:34,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057758932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:34,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:34,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:40:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157813327] [2024-11-19 10:40:34,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:34,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:40:34,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:34,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:40:34,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:40:34,635 INFO L87 Difference]: Start difference. First operand 557 states and 723 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 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-19 10:40:34,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:34,725 INFO L93 Difference]: Finished difference Result 645 states and 824 transitions. [2024-11-19 10:40:34,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:40:34,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 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-19 10:40:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:34,728 INFO L225 Difference]: With dead ends: 645 [2024-11-19 10:40:34,728 INFO L226 Difference]: Without dead ends: 644 [2024-11-19 10:40:34,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:40:34,729 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 63 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:34,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 940 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-19 10:40:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 618. [2024-11-19 10:40:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 523 states have (on average 1.4780114722753346) internal successors, (773), 596 states have internal predecessors, (773), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 10:40:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 807 transitions. [2024-11-19 10:40:34,758 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 807 transitions. Word has length 56 [2024-11-19 10:40:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:34,758 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 807 transitions. [2024-11-19 10:40:34,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 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-19 10:40:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 807 transitions. [2024-11-19 10:40:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 10:40:34,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:34,760 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-19 10:40:34,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 10:40:34,760 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:34,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1373371109, now seen corresponding path program 1 times [2024-11-19 10:40:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:34,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774034149] [2024-11-19 10:40:34,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:34,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:34,826 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-19 10:40:34,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:34,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774034149] [2024-11-19 10:40:34,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774034149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:34,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:34,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:40:34,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181136769] [2024-11-19 10:40:34,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:34,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:40:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:34,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:40:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:40:34,829 INFO L87 Difference]: Start difference. First operand 618 states and 807 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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-19 10:40:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:34,911 INFO L93 Difference]: Finished difference Result 1126 states and 1480 transitions. [2024-11-19 10:40:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:40:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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-19 10:40:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:34,914 INFO L225 Difference]: With dead ends: 1126 [2024-11-19 10:40:34,914 INFO L226 Difference]: Without dead ends: 618 [2024-11-19 10:40:34,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:40:34,916 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 20 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:34,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 776 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:34,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-19 10:40:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2024-11-19 10:40:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 523 states have (on average 1.474187380497132) internal successors, (771), 596 states have internal predecessors, (771), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 10:40:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 805 transitions. [2024-11-19 10:40:34,943 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 805 transitions. Word has length 57 [2024-11-19 10:40:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:34,944 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 805 transitions. [2024-11-19 10:40:34,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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-19 10:40:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 805 transitions. [2024-11-19 10:40:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 10:40:34,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:34,945 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:40:34,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 10:40:34,945 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:34,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1510040064, now seen corresponding path program 1 times [2024-11-19 10:40:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:34,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433789703] [2024-11-19 10:40:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:35,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:35,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433789703] [2024-11-19 10:40:35,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433789703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:35,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:35,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:40:35,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351876588] [2024-11-19 10:40:35,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:35,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:40:35,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:35,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:40:35,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:40:35,032 INFO L87 Difference]: Start difference. First operand 618 states and 805 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 10:40:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:35,324 INFO L93 Difference]: Finished difference Result 651 states and 806 transitions. [2024-11-19 10:40:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:40:35,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 83 [2024-11-19 10:40:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:35,327 INFO L225 Difference]: With dead ends: 651 [2024-11-19 10:40:35,327 INFO L226 Difference]: Without dead ends: 650 [2024-11-19 10:40:35,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:40:35,328 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 82 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:35,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 379 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:40:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-19 10:40:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 618. [2024-11-19 10:40:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 523 states have (on average 1.468451242829828) internal successors, (768), 596 states have internal predecessors, (768), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 10:40:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 802 transitions. [2024-11-19 10:40:35,361 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 802 transitions. Word has length 83 [2024-11-19 10:40:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:35,362 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 802 transitions. [2024-11-19 10:40:35,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 10:40:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 802 transitions. [2024-11-19 10:40:35,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 10:40:35,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:35,363 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:40:35,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 10:40:35,363 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:35,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:35,364 INFO L85 PathProgramCache]: Analyzing trace with hash -433398094, now seen corresponding path program 1 times [2024-11-19 10:40:35,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:35,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598727992] [2024-11-19 10:40:35,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:35,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:35,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:35,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598727992] [2024-11-19 10:40:35,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598727992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:35,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:35,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:40:35,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894974109] [2024-11-19 10:40:35,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:35,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:40:35,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:35,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:40:35,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:40:35,515 INFO L87 Difference]: Start difference. First operand 618 states and 802 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 10:40:35,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:35,936 INFO L93 Difference]: Finished difference Result 665 states and 824 transitions. [2024-11-19 10:40:35,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:40:35,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 84 [2024-11-19 10:40:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:35,939 INFO L225 Difference]: With dead ends: 665 [2024-11-19 10:40:35,939 INFO L226 Difference]: Without dead ends: 664 [2024-11-19 10:40:35,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-19 10:40:35,940 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 461 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:35,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 319 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 10:40:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-11-19 10:40:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 618. [2024-11-19 10:40:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 523 states have (on average 1.462715105162524) internal successors, (765), 596 states have internal predecessors, (765), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 10:40:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 799 transitions. [2024-11-19 10:40:35,976 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 799 transitions. Word has length 84 [2024-11-19 10:40:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:35,976 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 799 transitions. [2024-11-19 10:40:35,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 10:40:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 799 transitions. [2024-11-19 10:40:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 10:40:35,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:35,977 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:40:35,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 10:40:35,978 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:35,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash -433399600, now seen corresponding path program 1 times [2024-11-19 10:40:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:35,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777800408] [2024-11-19 10:40:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777800408] [2024-11-19 10:40:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777800408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:36,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:40:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58764053] [2024-11-19 10:40:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:36,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:40:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:40:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:40:36,085 INFO L87 Difference]: Start difference. First operand 618 states and 799 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 10:40:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:36,209 INFO L93 Difference]: Finished difference Result 807 states and 1016 transitions. [2024-11-19 10:40:36,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 10:40:36,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 84 [2024-11-19 10:40:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:36,211 INFO L225 Difference]: With dead ends: 807 [2024-11-19 10:40:36,211 INFO L226 Difference]: Without dead ends: 299 [2024-11-19 10:40:36,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:40:36,212 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 84 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:36,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 570 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:40:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-19 10:40:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 242. [2024-11-19 10:40:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 198 states have (on average 1.2424242424242424) internal successors, (246), 230 states have internal predecessors, (246), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 10:40:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 260 transitions. [2024-11-19 10:40:36,226 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 260 transitions. Word has length 84 [2024-11-19 10:40:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:36,227 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 260 transitions. [2024-11-19 10:40:36,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 10:40:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 260 transitions. [2024-11-19 10:40:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 10:40:36,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:36,228 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:40:36,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 10:40:36,228 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:36,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:36,229 INFO L85 PathProgramCache]: Analyzing trace with hash -550485519, now seen corresponding path program 1 times [2024-11-19 10:40:36,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:36,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525728564] [2024-11-19 10:40:36,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:36,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:36,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:36,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525728564] [2024-11-19 10:40:36,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525728564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:36,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:36,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:40:36,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185559206] [2024-11-19 10:40:36,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:36,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:40:36,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:36,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:40:36,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:40:36,338 INFO L87 Difference]: Start difference. First operand 242 states and 260 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 10:40:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:36,441 INFO L93 Difference]: Finished difference Result 279 states and 298 transitions. [2024-11-19 10:40:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 10:40:36,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 85 [2024-11-19 10:40:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:36,443 INFO L225 Difference]: With dead ends: 279 [2024-11-19 10:40:36,443 INFO L226 Difference]: Without dead ends: 278 [2024-11-19 10:40:36,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-19 10:40:36,444 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 30 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:36,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 787 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:40:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-19 10:40:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 269. [2024-11-19 10:40:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 223 states have (on average 1.2197309417040358) internal successors, (272), 255 states have internal predecessors, (272), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:40:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 288 transitions. [2024-11-19 10:40:36,458 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 288 transitions. Word has length 85 [2024-11-19 10:40:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:36,458 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 288 transitions. [2024-11-19 10:40:36,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 10:40:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 288 transitions. [2024-11-19 10:40:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 10:40:36,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:36,460 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, 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-19 10:40:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 10:40:36,460 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:36,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1911267369, now seen corresponding path program 1 times [2024-11-19 10:40:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385833713] [2024-11-19 10:40:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:36,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:36,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385833713] [2024-11-19 10:40:36,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385833713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:40:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816910131] [2024-11-19 10:40:36,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:36,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:36,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:36,566 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-19 10:40:36,568 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-19 10:40:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:36,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:40:36,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:40:36,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:40:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:36,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816910131] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:40:36,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:40:36,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2024-11-19 10:40:36,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597853334] [2024-11-19 10:40:36,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:40:36,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 10:40:36,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 10:40:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:40:36,871 INFO L87 Difference]: Start difference. First operand 269 states and 288 transitions. Second operand has 14 states, 13 states have (on average 11.76923076923077) internal successors, (153), 14 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 10:40:37,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:37,065 INFO L93 Difference]: Finished difference Result 383 states and 410 transitions. [2024-11-19 10:40:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 10:40:37,066 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 11.76923076923077) internal successors, (153), 14 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 89 [2024-11-19 10:40:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:37,068 INFO L225 Difference]: With dead ends: 383 [2024-11-19 10:40:37,068 INFO L226 Difference]: Without dead ends: 382 [2024-11-19 10:40:37,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2024-11-19 10:40:37,069 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 93 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:37,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1088 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:40:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-19 10:40:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 340. [2024-11-19 10:40:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 290 states have (on average 1.2793103448275862) internal successors, (371), 322 states have internal predecessors, (371), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 10:40:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 391 transitions. [2024-11-19 10:40:37,095 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 391 transitions. Word has length 89 [2024-11-19 10:40:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:37,095 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 391 transitions. [2024-11-19 10:40:37,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 11.76923076923077) internal successors, (153), 14 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 10:40:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 391 transitions. [2024-11-19 10:40:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 10:40:37,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:37,096 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, 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-19 10:40:37,114 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-19 10:40:37,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:37,301 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:37,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:37,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1757806162, now seen corresponding path program 1 times [2024-11-19 10:40:37,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:37,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483535203] [2024-11-19 10:40:37,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:37,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:37,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:37,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483535203] [2024-11-19 10:40:37,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483535203] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:40:37,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841289874] [2024-11-19 10:40:37,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:37,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:37,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:37,440 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-19 10:40:37,441 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-19 10:40:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:37,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:40:37,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:40:37,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:40:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:37,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841289874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:40:37,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:40:37,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2024-11-19 10:40:37,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319752243] [2024-11-19 10:40:37,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:40:37,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 10:40:37,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:37,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 10:40:37,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-19 10:40:37,779 INFO L87 Difference]: Start difference. First operand 340 states and 391 transitions. Second operand has 18 states, 17 states have (on average 9.0) internal successors, (153), 18 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 10:40:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:38,064 INFO L93 Difference]: Finished difference Result 443 states and 487 transitions. [2024-11-19 10:40:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 10:40:38,064 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 9.0) internal successors, (153), 18 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 89 [2024-11-19 10:40:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:38,066 INFO L225 Difference]: With dead ends: 443 [2024-11-19 10:40:38,066 INFO L226 Difference]: Without dead ends: 440 [2024-11-19 10:40:38,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2024-11-19 10:40:38,067 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 119 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:38,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1273 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:40:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-19 10:40:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 418. [2024-11-19 10:40:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 364 states have (on average 1.228021978021978) internal successors, (447), 396 states have internal predecessors, (447), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 10:40:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 471 transitions. [2024-11-19 10:40:38,104 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 471 transitions. Word has length 89 [2024-11-19 10:40:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:38,104 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 471 transitions. [2024-11-19 10:40:38,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 9.0) internal successors, (153), 18 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 10:40:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 471 transitions. [2024-11-19 10:40:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 10:40:38,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:38,107 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:40:38,124 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-19 10:40:38,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:38,308 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:38,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1518056853, now seen corresponding path program 1 times [2024-11-19 10:40:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:38,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720491785] [2024-11-19 10:40:38,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720491785] [2024-11-19 10:40:38,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720491785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:40:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843970860] [2024-11-19 10:40:38,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:38,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:38,430 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-19 10:40:38,432 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-19 10:40:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:38,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:40:38,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:40:38,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:40:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:38,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843970860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:40:38,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:40:38,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2024-11-19 10:40:38,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165377487] [2024-11-19 10:40:38,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:40:38,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:40:38,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:38,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:40:38,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:40:38,703 INFO L87 Difference]: Start difference. First operand 418 states and 471 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 10:40:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:38,799 INFO L93 Difference]: Finished difference Result 550 states and 613 transitions. [2024-11-19 10:40:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:40:38,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2024-11-19 10:40:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:38,801 INFO L225 Difference]: With dead ends: 550 [2024-11-19 10:40:38,801 INFO L226 Difference]: Without dead ends: 348 [2024-11-19 10:40:38,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 177 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 10:40:38,802 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 16 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:38,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 630 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-19 10:40:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-11-19 10:40:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 298 states have (on average 1.1711409395973154) internal successors, (349), 330 states have internal predecessors, (349), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 10:40:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 369 transitions. [2024-11-19 10:40:38,826 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 369 transitions. Word has length 91 [2024-11-19 10:40:38,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:38,826 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 369 transitions. [2024-11-19 10:40:38,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 10:40:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 369 transitions. [2024-11-19 10:40:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 10:40:38,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:38,828 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:40:38,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 10:40:39,031 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,SelfDestructingSolverStorable21 [2024-11-19 10:40:39,032 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:39,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:39,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1227833065, now seen corresponding path program 1 times [2024-11-19 10:40:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110144863] [2024-11-19 10:40:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:39,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:39,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110144863] [2024-11-19 10:40:39,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110144863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:40:39,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218009779] [2024-11-19 10:40:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:39,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:39,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:39,150 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-19 10:40:39,151 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-19 10:40:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:39,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 10:40:39,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:40:39,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:40:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218009779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:39,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:40:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2024-11-19 10:40:39,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518280564] [2024-11-19 10:40:39,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:39,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:40:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:39,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:40:39,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:40:39,261 INFO L87 Difference]: Start difference. First operand 348 states and 369 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:40:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:39,358 INFO L93 Difference]: Finished difference Result 575 states and 614 transitions. [2024-11-19 10:40:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:40:39,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2024-11-19 10:40:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:39,360 INFO L225 Difference]: With dead ends: 575 [2024-11-19 10:40:39,360 INFO L226 Difference]: Without dead ends: 379 [2024-11-19 10:40:39,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-19 10:40:39,361 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 28 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:39,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 733 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:39,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-19 10:40:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 348. [2024-11-19 10:40:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 301 states have (on average 1.1528239202657806) internal successors, (347), 330 states have internal predecessors, (347), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 10:40:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 367 transitions. [2024-11-19 10:40:39,383 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 367 transitions. Word has length 99 [2024-11-19 10:40:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:39,383 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 367 transitions. [2024-11-19 10:40:39,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:40:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 367 transitions. [2024-11-19 10:40:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 10:40:39,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:39,384 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:40:39,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 10:40:39,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 10:40:39,586 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:39,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:39,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1256238025, now seen corresponding path program 1 times [2024-11-19 10:40:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:39,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622479644] [2024-11-19 10:40:39,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:39,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:40:39,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1676526511] [2024-11-19 10:40:39,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:39,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:40:39,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:40:39,609 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:40:39,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 10:40:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:39,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:40:39,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:40:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:39,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:40:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:40:39,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:39,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622479644] [2024-11-19 10:40:39,917 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:40:39,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676526511] [2024-11-19 10:40:39,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676526511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:40:39,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 10:40:39,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-19 10:40:39,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502653794] [2024-11-19 10:40:39,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 10:40:39,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:40:39,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:39,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:40:39,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:40:39,919 INFO L87 Difference]: Start difference. First operand 348 states and 367 transitions. Second operand has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 10:40:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:40,243 INFO L93 Difference]: Finished difference Result 579 states and 657 transitions. [2024-11-19 10:40:40,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:40:40,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 104 [2024-11-19 10:40:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:40,246 INFO L225 Difference]: With dead ends: 579 [2024-11-19 10:40:40,246 INFO L226 Difference]: Without dead ends: 528 [2024-11-19 10:40:40,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:40:40,247 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 225 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:40,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 393 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:40:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-19 10:40:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 472. [2024-11-19 10:40:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 436 states have (on average 1.165137614678899) internal successors, (508), 450 states have internal predecessors, (508), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 10:40:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 536 transitions. [2024-11-19 10:40:40,281 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 536 transitions. Word has length 104 [2024-11-19 10:40:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:40,281 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 536 transitions. [2024-11-19 10:40:40,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 10:40:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 536 transitions. [2024-11-19 10:40:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-19 10:40:40,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:40,284 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-19 10:40:40,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 10:40:40,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 10:40:40,485 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:40,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash -634054070, now seen corresponding path program 1 times [2024-11-19 10:40:40,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:40,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729753468] [2024-11-19 10:40:40,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:40,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 10:40:40,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:40,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729753468] [2024-11-19 10:40:40,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729753468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:40,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:40,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:40:40,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914917874] [2024-11-19 10:40:40,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:40,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:40:40,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:40,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:40:40,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:40:40,539 INFO L87 Difference]: Start difference. First operand 472 states and 536 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 10:40:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:40,574 INFO L93 Difference]: Finished difference Result 490 states and 550 transitions. [2024-11-19 10:40:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:40:40,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 149 [2024-11-19 10:40:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:40,577 INFO L225 Difference]: With dead ends: 490 [2024-11-19 10:40:40,578 INFO L226 Difference]: Without dead ends: 215 [2024-11-19 10:40:40,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 10:40:40,579 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:40,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 190 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-19 10:40:40,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-19 10:40:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 197 states have (on average 1.0253807106598984) internal successors, (202), 199 states have internal predecessors, (202), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:40:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 218 transitions. [2024-11-19 10:40:40,597 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 218 transitions. Word has length 149 [2024-11-19 10:40:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:40,598 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 218 transitions. [2024-11-19 10:40:40,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 10:40:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 218 transitions. [2024-11-19 10:40:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-19 10:40:40,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:40:40,601 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:40:40,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 10:40:40,601 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-19 10:40:40,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:40:40,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2134300761, now seen corresponding path program 1 times [2024-11-19 10:40:40,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:40:40,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984369681] [2024-11-19 10:40:40,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:40:40,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:40:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:40:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-19 10:40:40,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:40:40,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984369681] [2024-11-19 10:40:40,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984369681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:40:40,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:40:40,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:40:40,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011973206] [2024-11-19 10:40:40,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:40:40,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:40:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:40:40,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:40:40,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:40:40,732 INFO L87 Difference]: Start difference. First operand 215 states and 218 transitions. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 10:40:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:40:40,782 INFO L93 Difference]: Finished difference Result 215 states and 218 transitions. [2024-11-19 10:40:40,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:40:40,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 177 [2024-11-19 10:40:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:40:40,783 INFO L225 Difference]: With dead ends: 215 [2024-11-19 10:40:40,783 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:40:40,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:40:40,785 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:40:40,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 369 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:40:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:40:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:40:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:40:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:40:40,788 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2024-11-19 10:40:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:40:40,788 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:40:40,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 10:40:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:40:40,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:40:40,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 98 remaining) [2024-11-19 10:40:40,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 98 remaining) [2024-11-19 10:40:40,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 98 remaining) [2024-11-19 10:40:40,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 98 remaining) [2024-11-19 10:40:40,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 98 remaining) [2024-11-19 10:40:40,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 98 remaining) [2024-11-19 10:40:40,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 98 remaining) [2024-11-19 10:40:40,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 98 remaining) [2024-11-19 10:40:40,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 98 remaining) [2024-11-19 10:40:40,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 98 remaining) [2024-11-19 10:40:40,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 98 remaining) [2024-11-19 10:40:40,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 98 remaining) [2024-11-19 10:40:40,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 98 remaining) [2024-11-19 10:40:40,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 98 remaining) [2024-11-19 10:40:40,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 98 remaining) [2024-11-19 10:40:40,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 98 remaining) [2024-11-19 10:40:40,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 98 remaining) [2024-11-19 10:40:40,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 98 remaining) [2024-11-19 10:40:40,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 98 remaining) [2024-11-19 10:40:40,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 98 remaining) [2024-11-19 10:40:40,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 98 remaining) [2024-11-19 10:40:40,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 98 remaining) [2024-11-19 10:40:40,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 98 remaining) [2024-11-19 10:40:40,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 98 remaining) [2024-11-19 10:40:40,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 98 remaining) [2024-11-19 10:40:40,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 98 remaining) [2024-11-19 10:40:40,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 98 remaining) [2024-11-19 10:40:40,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 98 remaining) [2024-11-19 10:40:40,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 98 remaining) [2024-11-19 10:40:40,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 98 remaining) [2024-11-19 10:40:40,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 98 remaining) [2024-11-19 10:40:40,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 98 remaining) [2024-11-19 10:40:40,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 98 remaining) [2024-11-19 10:40:40,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 98 remaining) [2024-11-19 10:40:40,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 98 remaining) [2024-11-19 10:40:40,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 98 remaining) [2024-11-19 10:40:40,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 98 remaining) [2024-11-19 10:40:40,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 98 remaining) [2024-11-19 10:40:40,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 98 remaining) [2024-11-19 10:40:40,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 98 remaining) [2024-11-19 10:40:40,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 98 remaining) [2024-11-19 10:40:40,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 98 remaining) [2024-11-19 10:40:40,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 98 remaining) [2024-11-19 10:40:40,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 98 remaining) [2024-11-19 10:40:40,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 98 remaining) [2024-11-19 10:40:40,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 98 remaining) [2024-11-19 10:40:40,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 98 remaining) [2024-11-19 10:40:40,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 98 remaining) [2024-11-19 10:40:40,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 98 remaining) [2024-11-19 10:40:40,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 98 remaining) [2024-11-19 10:40:40,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 98 remaining) [2024-11-19 10:40:40,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 98 remaining) [2024-11-19 10:40:40,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 98 remaining) [2024-11-19 10:40:40,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 98 remaining) [2024-11-19 10:40:40,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 98 remaining) [2024-11-19 10:40:40,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 98 remaining) [2024-11-19 10:40:40,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 98 remaining) [2024-11-19 10:40:40,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 98 remaining) [2024-11-19 10:40:40,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 98 remaining) [2024-11-19 10:40:40,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 98 remaining) [2024-11-19 10:40:40,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 98 remaining) [2024-11-19 10:40:40,804 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 98 remaining) [2024-11-19 10:40:40,804 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 98 remaining) [2024-11-19 10:40:40,804 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 98 remaining) [2024-11-19 10:40:40,804 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 98 remaining) [2024-11-19 10:40:40,804 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 98 remaining) [2024-11-19 10:40:40,804 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 98 remaining) [2024-11-19 10:40:40,804 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 98 remaining) [2024-11-19 10:40:40,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 98 remaining) [2024-11-19 10:40:40,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 98 remaining) [2024-11-19 10:40:40,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 98 remaining) [2024-11-19 10:40:40,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 98 remaining) [2024-11-19 10:40:40,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 98 remaining) [2024-11-19 10:40:40,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 98 remaining) [2024-11-19 10:40:40,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 98 remaining) [2024-11-19 10:40:40,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 98 remaining) [2024-11-19 10:40:40,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 98 remaining) [2024-11-19 10:40:40,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 98 remaining) [2024-11-19 10:40:40,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 98 remaining) [2024-11-19 10:40:40,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 98 remaining) [2024-11-19 10:40:40,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 98 remaining) [2024-11-19 10:40:40,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 98 remaining) [2024-11-19 10:40:40,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 98 remaining) [2024-11-19 10:40:40,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 98 remaining) [2024-11-19 10:40:40,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 98 remaining) [2024-11-19 10:40:40,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 98 remaining) [2024-11-19 10:40:40,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 98 remaining) [2024-11-19 10:40:40,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 98 remaining) [2024-11-19 10:40:40,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 98 remaining) [2024-11-19 10:40:40,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 98 remaining) [2024-11-19 10:40:40,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 98 remaining) [2024-11-19 10:40:40,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 98 remaining) [2024-11-19 10:40:40,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 98 remaining) [2024-11-19 10:40:40,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 98 remaining) [2024-11-19 10:40:40,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 98 remaining) [2024-11-19 10:40:40,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 98 remaining) [2024-11-19 10:40:40,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 98 remaining) [2024-11-19 10:40:40,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 98 remaining) [2024-11-19 10:40:40,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 10:40:40,812 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:40:40,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:40:48,199 WARN L286 SmtUtils]: Spent 7.30s on a formula simplification. DAG size of input: 68 DAG size of output: 52 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-19 10:40:53,629 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:40:53,644 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,645 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,646 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,646 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,647 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,648 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,654 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,654 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,657 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:40:53,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:40:53 BoogieIcfgContainer [2024-11-19 10:40:53,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:40:53,675 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:40:53,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:40:53,676 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:40:53,677 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:40:25" (3/4) ... [2024-11-19 10:40:53,679 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:40:53,683 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-19 10:40:53,683 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-19 10:40:53,695 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-19 10:40:53,696 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 10:40:53,696 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:40:53,697 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:40:53,806 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:40:53,806 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:40:53,807 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:40:53,807 INFO L158 Benchmark]: Toolchain (without parser) took 29298.92ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 121.8MB in the beginning and 136.6MB in the end (delta: -14.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-11-19 10:40:53,808 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:40:53,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.66ms. Allocated memory is still 157.3MB. Free memory was 121.2MB in the beginning and 107.7MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:40:53,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.14ms. Allocated memory is still 157.3MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:40:53,809 INFO L158 Benchmark]: Boogie Preprocessor took 49.84ms. Allocated memory is still 157.3MB. Free memory was 105.6MB in the beginning and 103.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:40:53,809 INFO L158 Benchmark]: RCFGBuilder took 749.69ms. Allocated memory is still 157.3MB. Free memory was 103.5MB in the beginning and 74.5MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 10:40:53,809 INFO L158 Benchmark]: TraceAbstraction took 27987.96ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 73.5MB in the beginning and 143.9MB in the end (delta: -70.4MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2024-11-19 10:40:53,809 INFO L158 Benchmark]: Witness Printer took 131.80ms. Allocated memory is still 190.8MB. Free memory was 143.9MB in the beginning and 136.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 10:40:53,811 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.66ms. Allocated memory is still 157.3MB. Free memory was 121.2MB in the beginning and 107.7MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.14ms. Allocated memory is still 157.3MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.84ms. Allocated memory is still 157.3MB. Free memory was 105.6MB in the beginning and 103.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 749.69ms. Allocated memory is still 157.3MB. Free memory was 103.5MB in the beginning and 74.5MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27987.96ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 73.5MB in the beginning and 143.9MB in the end (delta: -70.4MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. * Witness Printer took 131.80ms. Allocated memory is still 190.8MB. Free memory was 143.9MB in the beginning and 136.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 227 locations, 98 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3382 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3341 mSDsluCounter, 14579 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10436 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3317 IncrementalHoareTripleChecker+Invalid, 3500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 4143 mSDtfsCounter, 3317 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 1061 SyntacticMatches, 5 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=618occurred in iteration=14, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 688 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2246 NumberOfCodeBlocks, 2246 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2372 ConstructedInterpolants, 15 QuantifiedInterpolants, 8022 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1246 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 37 InterpolantComputations, 20 PerfectInterpolantSequences, 426/495 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 98 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((counter == 3) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (r <= 0)) && (A <= 2147483647)) || (((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) && (4 <= counter)) && (counter <= 2147483646))) || ((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (3 == v)) && (A <= 2147483647)) && (4 <= counter)) && (counter <= 2147483646)) && (0 <= A))) || ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (counter == 0)) && (A <= 2147483647))) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) && (counter == 1)) || (((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (3 == v)) && (A <= 2147483647)) && (0 <= A)) && (counter == 2))) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (counter <= 2147483645)) && (A <= 2147483647)) && (3 <= counter)) || (((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (r <= 0)) && (A <= 2147483647)) && (counter == 2))) || ((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (3 == v)) && (counter <= 2147483645)) && (A <= 2147483647)) && (0 <= A)) && (3 <= counter))) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (((cond != 0) && (counter == 0)) && (counter == \old(counter))) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:40:53,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE