./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/hh2012-ex3.i -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 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:26:40,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:26:40,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:26:40,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:26:40,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:26:40,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:26:40,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:26:40,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:26:40,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:26:40,232 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:26:40,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:26:40,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:26:40,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:26:40,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:26:40,234 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:26:40,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:26:40,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:26:40,237 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:26:40,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:26:40,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:26:40,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:26:40,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:26:40,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:26:40,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:26:40,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:26:40,242 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:26:40,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:26:40,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:26:40,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:26:40,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:26:40,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:26:40,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:26:40,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:26:40,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:26:40,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:26:40,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:26:40,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:26:40,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:26:40,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:26:40,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:26:40,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:26:40,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:26:40,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:26:40,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:26:40,246 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 -> 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb [2024-11-09 11:26:40,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:26:40,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:26:40,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:26:40,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:26:40,570 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:26:40,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-11-09 11:26:41,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:26:42,111 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:26:42,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-11-09 11:26:42,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d9e005f/eb08c28a4c9e47f8baa8c41d12b4b194/FLAG2a20204b4 [2024-11-09 11:26:42,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d9e005f/eb08c28a4c9e47f8baa8c41d12b4b194 [2024-11-09 11:26:42,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:26:42,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:26:42,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:26:42,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:26:42,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:26:42,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291a22cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42, skipping insertion in model container [2024-11-09 11:26:42,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:26:42,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:26:42,743 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:26:42,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:26:42,781 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:26:42,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42 WrapperNode [2024-11-09 11:26:42,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:26:42,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:26:42,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:26:42,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:26:42,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,815 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2024-11-09 11:26:42,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:26:42,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:26:42,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:26:42,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:26:42,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,844 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:26:42,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:26:42,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:26:42,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:26:42,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:26:42,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (1/1) ... [2024-11-09 11:26:42,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:26:42,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:42,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:26:42,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:26:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:26:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:26:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:26:42,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:26:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:26:42,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:26:42,996 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:26:42,998 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:26:43,157 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-09 11:26:43,157 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:26:43,176 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:26:43,176 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:26:43,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:26:43 BoogieIcfgContainer [2024-11-09 11:26:43,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:26:43,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:26:43,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:26:43,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:26:43,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:26:42" (1/3) ... [2024-11-09 11:26:43,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6f198b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:26:43, skipping insertion in model container [2024-11-09 11:26:43,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:42" (2/3) ... [2024-11-09 11:26:43,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6f198b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:26:43, skipping insertion in model container [2024-11-09 11:26:43,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:26:43" (3/3) ... [2024-11-09 11:26:43,184 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2024-11-09 11:26:43,226 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:26:43,227 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-09 11:26:43,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:26:43,301 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;@75fcbfea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:26:43,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-09 11:26:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 25 states have (on average 1.72) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:26:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 11:26:43,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:43,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 11:26:43,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:43,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2024-11-09 11:26:43,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:43,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696887002] [2024-11-09 11:26:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:26:43,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:43,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696887002] [2024-11-09 11:26:43,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696887002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:43,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:43,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:26:43,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536952132] [2024-11-09 11:26:43,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:43,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:26:43,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:43,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:26:43,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:43,531 INFO L87 Difference]: Start difference. First operand has 47 states, 25 states have (on average 1.72) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:26:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:43,638 INFO L93 Difference]: Finished difference Result 107 states and 157 transitions. [2024-11-09 11:26:43,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:26:43,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 11:26:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:43,648 INFO L225 Difference]: With dead ends: 107 [2024-11-09 11:26:43,648 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 11:26:43,651 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-09 11:26:43,654 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:43,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 119 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 11:26:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2024-11-09 11:26:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 23 states have (on average 1.608695652173913) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:26:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-09 11:26:43,689 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 5 [2024-11-09 11:26:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:43,690 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-09 11:26:43,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:26:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-09 11:26:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:26:43,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:43,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:43,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:26:43,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:43,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1810845099, now seen corresponding path program 1 times [2024-11-09 11:26:43,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:43,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515845743] [2024-11-09 11:26:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:43,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:26:43,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:43,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515845743] [2024-11-09 11:26:43,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515845743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:43,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:43,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:26:43,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702779922] [2024-11-09 11:26:43,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:43,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:26:43,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:26:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:43,783 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:26:43,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:43,848 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2024-11-09 11:26:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:26:43,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-09 11:26:43,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:43,850 INFO L225 Difference]: With dead ends: 89 [2024-11-09 11:26:43,850 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 11:26:43,850 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-09 11:26:43,851 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:43,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 11:26:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-11-09 11:26:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 39 states have internal predecessors, (43), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:26:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2024-11-09 11:26:43,868 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 7 [2024-11-09 11:26:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:43,868 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2024-11-09 11:26:43,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:26:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2024-11-09 11:26:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 11:26:43,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:43,869 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:43,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:26:43,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:43,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash 383340459, now seen corresponding path program 1 times [2024-11-09 11:26:43,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:43,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929362278] [2024-11-09 11:26:43,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:44,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:26:44,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:44,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929362278] [2024-11-09 11:26:44,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929362278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:44,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:44,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:26:44,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906850860] [2024-11-09 11:26:44,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:44,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:26:44,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:44,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:26:44,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:26:44,030 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:26:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:44,140 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-11-09 11:26:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:26:44,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 19 [2024-11-09 11:26:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:44,142 INFO L225 Difference]: With dead ends: 63 [2024-11-09 11:26:44,142 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 11:26:44,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:26:44,143 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:44,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 99 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:44,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 11:26:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2024-11-09 11:26:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:26:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2024-11-09 11:26:44,163 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 19 [2024-11-09 11:26:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:44,163 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-11-09 11:26:44,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:26:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2024-11-09 11:26:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 11:26:44,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:44,166 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:44,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:26:44,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:44,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:44,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1001347595, now seen corresponding path program 1 times [2024-11-09 11:26:44,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:44,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651739755] [2024-11-09 11:26:44,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:44,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:44,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:26:44,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:44,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651739755] [2024-11-09 11:26:44,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651739755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:44,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:44,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:26:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123491601] [2024-11-09 11:26:44,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:44,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:26:44,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:44,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:26:44,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:26:44,255 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:26:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:44,325 INFO L93 Difference]: Finished difference Result 106 states and 132 transitions. [2024-11-09 11:26:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:26:44,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 20 [2024-11-09 11:26:44,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:44,327 INFO L225 Difference]: With dead ends: 106 [2024-11-09 11:26:44,327 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 11:26:44,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:26:44,329 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 111 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:44,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 111 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 11:26:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-09 11:26:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 41 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:26:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2024-11-09 11:26:44,339 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 20 [2024-11-09 11:26:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:44,340 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-11-09 11:26:44,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:26:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2024-11-09 11:26:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 11:26:44,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:44,343 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:44,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:26:44,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:44,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1976545669, now seen corresponding path program 1 times [2024-11-09 11:26:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:44,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390360425] [2024-11-09 11:26:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:44,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:44,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:44,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:44,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:26:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:44,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390360425] [2024-11-09 11:26:44,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390360425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:44,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097986782] [2024-11-09 11:26:44,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:44,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:44,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:44,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:44,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:26:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:44,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:26:44,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:26:44,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:26:44,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097986782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:44,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:26:44,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 11:26:44,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962247860] [2024-11-09 11:26:44,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:44,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:26:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:26:44,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:26:44,653 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-09 11:26:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:44,737 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2024-11-09 11:26:44,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:26:44,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 32 [2024-11-09 11:26:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:44,740 INFO L225 Difference]: With dead ends: 91 [2024-11-09 11:26:44,742 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 11:26:44,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:26:44,744 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:44,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 132 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 11:26:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2024-11-09 11:26:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 53 states have internal predecessors, (63), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 11:26:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2024-11-09 11:26:44,765 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 32 [2024-11-09 11:26:44,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:44,772 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2024-11-09 11:26:44,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-09 11:26:44,772 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2024-11-09 11:26:44,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 11:26:44,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:44,774 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:44,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:26:44,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:44,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:44,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1143373541, now seen corresponding path program 1 times [2024-11-09 11:26:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:44,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612824235] [2024-11-09 11:26:44,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:26:45,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:45,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612824235] [2024-11-09 11:26:45,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612824235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460378704] [2024-11-09 11:26:45,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:45,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:45,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:45,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:45,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:26:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:26:45,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:26:45,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:26:45,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460378704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:45,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:45,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 11:26:45,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976027202] [2024-11-09 11:26:45,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:45,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:26:45,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:45,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:26:45,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:26:45,278 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 11:26:45,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:45,394 INFO L93 Difference]: Finished difference Result 132 states and 190 transitions. [2024-11-09 11:26:45,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:26:45,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 33 [2024-11-09 11:26:45,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:45,397 INFO L225 Difference]: With dead ends: 132 [2024-11-09 11:26:45,397 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 11:26:45,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:26:45,398 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:45,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 160 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 11:26:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2024-11-09 11:26:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 71 states have internal predecessors, (91), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 11:26:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-11-09 11:26:45,412 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 33 [2024-11-09 11:26:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:45,412 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-11-09 11:26:45,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 11:26:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-11-09 11:26:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 11:26:45,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:45,413 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:45,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:26:45,614 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,SelfDestructingSolverStorable5 [2024-11-09 11:26:45,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:45,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1084841347, now seen corresponding path program 1 times [2024-11-09 11:26:45,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:45,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15803545] [2024-11-09 11:26:45,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:45,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:26:45,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:45,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15803545] [2024-11-09 11:26:45,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15803545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:45,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092397766] [2024-11-09 11:26:45,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:45,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:45,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:45,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:45,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:26:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:45,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:26:45,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:26:45,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:26:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092397766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:45,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:26:45,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 11:26:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627865876] [2024-11-09 11:26:45,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:45,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:26:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:26:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:26:45,796 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-09 11:26:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:45,868 INFO L93 Difference]: Finished difference Result 102 states and 147 transitions. [2024-11-09 11:26:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:26:45,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 34 [2024-11-09 11:26:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:45,874 INFO L225 Difference]: With dead ends: 102 [2024-11-09 11:26:45,874 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 11:26:45,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:26:45,875 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:45,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 67 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 11:26:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-09 11:26:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 61 states have (on average 1.360655737704918) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 11:26:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2024-11-09 11:26:45,896 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 34 [2024-11-09 11:26:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:45,897 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2024-11-09 11:26:45,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-09 11:26:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2024-11-09 11:26:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 11:26:45,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:45,898 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:45,914 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-09 11:26:46,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:46,099 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:46,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash 729656669, now seen corresponding path program 1 times [2024-11-09 11:26:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:46,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750545372] [2024-11-09 11:26:46,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:46,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 11:26:46,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:46,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750545372] [2024-11-09 11:26:46,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750545372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:46,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:46,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:26:46,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763220005] [2024-11-09 11:26:46,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:46,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:26:46,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:46,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:26:46,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:46,167 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-09 11:26:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:46,204 INFO L93 Difference]: Finished difference Result 99 states and 139 transitions. [2024-11-09 11:26:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:26:46,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 35 [2024-11-09 11:26:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:46,206 INFO L225 Difference]: With dead ends: 99 [2024-11-09 11:26:46,206 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 11:26:46,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:46,208 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:46,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:26:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 11:26:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 11:26:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 68 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 11:26:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-11-09 11:26:46,219 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 35 [2024-11-09 11:26:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:46,219 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-11-09 11:26:46,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-09 11:26:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-09 11:26:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 11:26:46,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:46,221 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:46,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:26:46,221 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:46,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2120300131, now seen corresponding path program 1 times [2024-11-09 11:26:46,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:46,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928907390] [2024-11-09 11:26:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:46,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:26:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:26:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:26:46,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928907390] [2024-11-09 11:26:46,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928907390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662266365] [2024-11-09 11:26:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:46,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:46,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:46,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:46,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:26:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:46,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:26:46,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:26:46,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:26:46,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662266365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:46,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:46,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-09 11:26:46,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757212744] [2024-11-09 11:26:46,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:46,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:26:46,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:46,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:26:46,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:26:46,621 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 11:26:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:46,756 INFO L93 Difference]: Finished difference Result 159 states and 216 transitions. [2024-11-09 11:26:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:26:46,757 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 47 [2024-11-09 11:26:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:46,759 INFO L225 Difference]: With dead ends: 159 [2024-11-09 11:26:46,760 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 11:26:46,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:26:46,763 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:46,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 174 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 11:26:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2024-11-09 11:26:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 71 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 11:26:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2024-11-09 11:26:46,777 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 47 [2024-11-09 11:26:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:46,778 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2024-11-09 11:26:46,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 11:26:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2024-11-09 11:26:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 11:26:46,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:46,781 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:46,801 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-09 11:26:46,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:46,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:46,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash -534868754, now seen corresponding path program 1 times [2024-11-09 11:26:46,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:46,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712102154] [2024-11-09 11:26:46,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:46,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:26:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:26:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 11:26:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:26:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 11:26:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 11:26:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 11:26:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 11:26:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 11:26:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 11:26:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 11:26:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 11:26:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 11:26:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:47,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712102154] [2024-11-09 11:26:47,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712102154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:47,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068023352] [2024-11-09 11:26:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:47,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:47,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:47,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:47,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:26:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 11:26:47,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 192 proven. 36 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-09 11:26:47,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 11:26:47,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068023352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:47,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:47,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2024-11-09 11:26:47,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591388439] [2024-11-09 11:26:47,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:47,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:26:47,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:47,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:26:47,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:26:47,506 INFO L87 Difference]: Start difference. First operand 105 states and 142 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-09 11:26:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:47,592 INFO L93 Difference]: Finished difference Result 175 states and 233 transitions. [2024-11-09 11:26:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:26:47,593 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 108 [2024-11-09 11:26:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:47,594 INFO L225 Difference]: With dead ends: 175 [2024-11-09 11:26:47,594 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 11:26:47,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 239 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:26:47,596 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:47,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 159 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 11:26:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2024-11-09 11:26:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.178082191780822) internal successors, (86), 78 states have internal predecessors, (86), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 11:26:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2024-11-09 11:26:47,613 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 108 [2024-11-09 11:26:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:47,614 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2024-11-09 11:26:47,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-09 11:26:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2024-11-09 11:26:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 11:26:47,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:47,619 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-11-09 11:26:47,638 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-09 11:26:47,820 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,SelfDestructingSolverStorable9 [2024-11-09 11:26:47,820 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:47,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2059042477, now seen corresponding path program 2 times [2024-11-09 11:26:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:47,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811076652] [2024-11-09 11:26:47,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:47,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:26:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:26:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 11:26:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:26:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 11:26:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 11:26:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 11:26:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 11:26:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:26:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 11:26:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 11:26:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 11:26:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 11:26:48,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:48,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811076652] [2024-11-09 11:26:48,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811076652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:48,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036025270] [2024-11-09 11:26:48,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:26:48,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:48,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:48,034 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:48,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:26:48,099 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:26:48,099 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:26:48,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:26:48,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 11:26:48,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 11:26:48,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036025270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:48,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:48,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2024-11-09 11:26:48,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168745436] [2024-11-09 11:26:48,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:48,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 11:26:48,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:48,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 11:26:48,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-09 11:26:48,452 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 24 states have internal predecessors, (75), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-11-09 11:26:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:48,694 INFO L93 Difference]: Finished difference Result 278 states and 426 transitions. [2024-11-09 11:26:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 11:26:48,695 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 24 states have internal predecessors, (75), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 114 [2024-11-09 11:26:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:48,698 INFO L225 Difference]: With dead ends: 278 [2024-11-09 11:26:48,698 INFO L226 Difference]: Without dead ends: 277 [2024-11-09 11:26:48,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-09 11:26:48,699 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 106 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:48,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 222 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:26:48,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-09 11:26:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 217. [2024-11-09 11:26:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 138 states have (on average 1.181159420289855) internal successors, (163), 143 states have internal predecessors, (163), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-09 11:26:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 307 transitions. [2024-11-09 11:26:48,717 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 307 transitions. Word has length 114 [2024-11-09 11:26:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:48,718 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 307 transitions. [2024-11-09 11:26:48,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 24 states have internal predecessors, (75), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-11-09 11:26:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 307 transitions. [2024-11-09 11:26:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 11:26:48,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:48,724 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:48,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:26:48,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:48,925 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1784005468, now seen corresponding path program 2 times [2024-11-09 11:26:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:48,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024605697] [2024-11-09 11:26:48,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:48,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:26:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:26:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 11:26:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:26:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 11:26:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 11:26:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 11:26:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 11:26:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:26:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 11:26:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 11:26:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 11:26:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 11:26:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 11:26:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 11:26:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 11:26:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2024-11-09 11:26:49,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:49,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024605697] [2024-11-09 11:26:49,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024605697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:49,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553298988] [2024-11-09 11:26:49,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:26:49,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:49,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:49,257 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:49,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:26:49,325 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:26:49,325 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:26:49,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:26:49,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 11:26:49,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:26:49,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553298988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:49,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:26:49,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2024-11-09 11:26:49,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383526487] [2024-11-09 11:26:49,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:49,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:26:49,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:49,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:26:49,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-09 11:26:49,538 INFO L87 Difference]: Start difference. First operand 217 states and 307 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-09 11:26:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:49,674 INFO L93 Difference]: Finished difference Result 229 states and 325 transitions. [2024-11-09 11:26:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 11:26:49,674 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 135 [2024-11-09 11:26:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:49,676 INFO L225 Difference]: With dead ends: 229 [2024-11-09 11:26:49,676 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 11:26:49,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-09 11:26:49,677 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:49,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 317 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 11:26:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2024-11-09 11:26:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 143 states have (on average 1.1818181818181819) internal successors, (169), 148 states have internal predecessors, (169), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-09 11:26:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 321 transitions. [2024-11-09 11:26:49,693 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 321 transitions. Word has length 135 [2024-11-09 11:26:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:49,695 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 321 transitions. [2024-11-09 11:26:49,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-09 11:26:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 321 transitions. [2024-11-09 11:26:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 11:26:49,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:49,697 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:49,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 11:26:49,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:49,900 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:49,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash -530405259, now seen corresponding path program 1 times [2024-11-09 11:26:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:49,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847151324] [2024-11-09 11:26:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:49,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:26:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:26:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 11:26:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:26:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 11:26:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 11:26:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 11:26:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 11:26:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:26:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 11:26:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 11:26:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 11:26:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 11:26:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 11:26:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 11:26:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 11:26:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 11:26:50,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:50,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847151324] [2024-11-09 11:26:50,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847151324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:50,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335376767] [2024-11-09 11:26:50,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:50,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:50,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:50,156 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:50,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:26:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:50,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:26:50,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 11:26:50,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 11:26:50,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335376767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:50,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:50,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-09 11:26:50,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625615445] [2024-11-09 11:26:50,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:50,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 11:26:50,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:50,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 11:26:50,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2024-11-09 11:26:50,636 INFO L87 Difference]: Start difference. First operand 226 states and 321 transitions. Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 11 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) [2024-11-09 11:26:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:50,854 INFO L93 Difference]: Finished difference Result 272 states and 387 transitions. [2024-11-09 11:26:50,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 11:26:50,855 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 11 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) Word has length 136 [2024-11-09 11:26:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:50,857 INFO L225 Difference]: With dead ends: 272 [2024-11-09 11:26:50,857 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 11:26:50,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2024-11-09 11:26:50,858 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:50,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 224 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:26:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 11:26:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 235. [2024-11-09 11:26:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 149 states have (on average 1.1610738255033557) internal successors, (173), 153 states have internal predecessors, (173), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-09 11:26:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 333 transitions. [2024-11-09 11:26:50,877 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 333 transitions. Word has length 136 [2024-11-09 11:26:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:50,878 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 333 transitions. [2024-11-09 11:26:50,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 11 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) [2024-11-09 11:26:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 333 transitions. [2024-11-09 11:26:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 11:26:50,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:50,880 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:50,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:26:51,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 11:26:51,081 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:51,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2023343308, now seen corresponding path program 1 times [2024-11-09 11:26:51,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:51,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021172309] [2024-11-09 11:26:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:51,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:26:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:26:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 11:26:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:26:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 11:26:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 11:26:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 11:26:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 11:26:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:26:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 11:26:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 11:26:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 11:26:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 11:26:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 11:26:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 11:26:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 11:26:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2024-11-09 11:26:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021172309] [2024-11-09 11:26:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021172309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621854434] [2024-11-09 11:26:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:51,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:51,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:51,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:26:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 11:26:51,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 70 proven. 10 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 11:26:51,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 20 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 11:26:52,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621854434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:52,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:52,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2024-11-09 11:26:52,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118495479] [2024-11-09 11:26:52,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:52,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 11:26:52,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:52,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 11:26:52,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 11:26:52,045 INFO L87 Difference]: Start difference. First operand 235 states and 333 transitions. Second operand has 33 states, 32 states have (on average 3.34375) internal successors, (107), 33 states have internal predecessors, (107), 11 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 11 states have call predecessors, (48), 11 states have call successors, (48) [2024-11-09 11:26:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:52,488 INFO L93 Difference]: Finished difference Result 235 states and 333 transitions. [2024-11-09 11:26:52,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 11:26:52,489 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.34375) internal successors, (107), 33 states have internal predecessors, (107), 11 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 11 states have call predecessors, (48), 11 states have call successors, (48) Word has length 141 [2024-11-09 11:26:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:52,491 INFO L225 Difference]: With dead ends: 235 [2024-11-09 11:26:52,491 INFO L226 Difference]: Without dead ends: 232 [2024-11-09 11:26:52,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1498, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 11:26:52,493 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:52,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:26:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-09 11:26:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 177. [2024-11-09 11:26:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.0789473684210527) internal successors, (123), 115 states have internal predecessors, (123), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 11:26:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 243 transitions. [2024-11-09 11:26:52,519 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 243 transitions. Word has length 141 [2024-11-09 11:26:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:52,521 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 243 transitions. [2024-11-09 11:26:52,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.34375) internal successors, (107), 33 states have internal predecessors, (107), 11 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 11 states have call predecessors, (48), 11 states have call successors, (48) [2024-11-09 11:26:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 243 transitions. [2024-11-09 11:26:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 11:26:52,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:52,524 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:52,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 11:26:52,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 11:26:52,724 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:52,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:52,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2023041925, now seen corresponding path program 1 times [2024-11-09 11:26:52,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214266264] [2024-11-09 11:26:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:26:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:26:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 11:26:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:26:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 11:26:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 11:26:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 11:26:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 11:26:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:26:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 11:26:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 11:26:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 11:26:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 11:26:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 11:26:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 11:26:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 11:26:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 11:26:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 11:26:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 11:26:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 11:26:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 11:26:53,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214266264] [2024-11-09 11:26:53,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214266264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687199128] [2024-11-09 11:26:53,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:53,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:53,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:53,022 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:53,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 11:26:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:26:53,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-11-09 11:26:53,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:26:53,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687199128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:53,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:26:53,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 23 [2024-11-09 11:26:53,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990287081] [2024-11-09 11:26:53,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:53,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:26:53,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:53,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:26:53,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-09 11:26:53,269 INFO L87 Difference]: Start difference. First operand 177 states and 243 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-09 11:26:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:53,392 INFO L93 Difference]: Finished difference Result 238 states and 324 transitions. [2024-11-09 11:26:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 11:26:53,393 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 165 [2024-11-09 11:26:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:53,394 INFO L225 Difference]: With dead ends: 238 [2024-11-09 11:26:53,394 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 11:26:53,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-09 11:26:53,396 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:53,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 180 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 11:26:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 11:26:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 11:26:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 158 transitions. [2024-11-09 11:26:53,408 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 158 transitions. Word has length 165 [2024-11-09 11:26:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:53,409 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 158 transitions. [2024-11-09 11:26:53,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-09 11:26:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 158 transitions. [2024-11-09 11:26:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-09 11:26:53,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:53,412 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 11:26:53,431 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-09 11:26:53,616 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,SelfDestructingSolverStorable14 [2024-11-09 11:26:53,617 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:53,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:53,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1766709868, now seen corresponding path program 1 times [2024-11-09 11:26:53,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:53,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930916621] [2024-11-09 11:26:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:53,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:26:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:26:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:26:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:26:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 11:26:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:26:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 11:26:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 11:26:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 11:26:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 11:26:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:26:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 11:26:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 11:26:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 11:26:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 11:26:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 11:26:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 11:26:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 11:26:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 11:26:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 11:26:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 11:26:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:26:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-09 11:26:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-09 11:26:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-09 11:26:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-09 11:26:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-09 11:26:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-09 11:26:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-09 11:26:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-09 11:26:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-09 11:26:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-09 11:26:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-09 11:26:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-09 11:26:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-09 11:26:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-09 11:26:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-09 11:26:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-09 11:26:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 0 proven. 282 refuted. 0 times theorem prover too weak. 3174 trivial. 0 not checked. [2024-11-09 11:26:54,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:54,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930916621] [2024-11-09 11:26:54,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930916621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:54,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764537636] [2024-11-09 11:26:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:54,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:54,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:54,278 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:54,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 11:26:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:54,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 11:26:54,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 36 proven. 266 refuted. 0 times theorem prover too weak. 3154 trivial. 0 not checked. [2024-11-09 11:26:54,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 36 proven. 266 refuted. 0 times theorem prover too weak. 3154 trivial. 0 not checked. [2024-11-09 11:26:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764537636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:55,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 35 [2024-11-09 11:26:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205730640] [2024-11-09 11:26:55,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:55,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 11:26:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:55,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 11:26:55,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 11:26:55,138 INFO L87 Difference]: Start difference. First operand 119 states and 158 transitions. Second operand has 36 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 16 states have call predecessors, (68), 16 states have call successors, (68) [2024-11-09 11:26:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:55,598 INFO L93 Difference]: Finished difference Result 231 states and 312 transitions. [2024-11-09 11:26:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 11:26:55,598 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 16 states have call predecessors, (68), 16 states have call successors, (68) Word has length 274 [2024-11-09 11:26:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:55,599 INFO L225 Difference]: With dead ends: 231 [2024-11-09 11:26:55,599 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:26:55,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=508, Invalid=2042, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 11:26:55,601 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:55,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 165 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:26:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:26:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:26:55,602 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-09 11:26:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:26:55,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 274 [2024-11-09 11:26:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:55,603 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:26:55,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 16 states have call predecessors, (68), 16 states have call successors, (68) [2024-11-09 11:26:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:26:55,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:26:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-11-09 11:26:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-11-09 11:26:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-11-09 11:26:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-11-09 11:26:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-11-09 11:26:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-11-09 11:26:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-11-09 11:26:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-11-09 11:26:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-11-09 11:26:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-11-09 11:26:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-11-09 11:26:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-11-09 11:26:55,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 11:26:55,809 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,SelfDestructingSolverStorable15 [2024-11-09 11:26:55,813 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:55,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:26:56,891 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:26:56,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:26:56 BoogieIcfgContainer [2024-11-09 11:26:56,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:26:56,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:26:56,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:26:56,910 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:26:56,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:26:43" (3/4) ... [2024-11-09 11:26:56,913 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:26:56,916 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:26:56,920 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-09 11:26:56,920 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:26:56,920 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:26:56,920 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:26:56,997 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:26:56,998 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:26:56,998 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:26:56,998 INFO L158 Benchmark]: Toolchain (without parser) took 14491.57ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 99.6MB in the beginning and 158.8MB in the end (delta: -59.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:26:56,999 INFO L158 Benchmark]: CDTParser took 1.20ms. Allocated memory is still 176.2MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:26:56,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.38ms. Allocated memory is still 176.2MB. Free memory was 99.5MB in the beginning and 139.7MB in the end (delta: -40.2MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-09 11:26:56,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.85ms. Allocated memory is still 176.2MB. Free memory was 139.7MB in the beginning and 138.7MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:26:56,999 INFO L158 Benchmark]: Boogie Preprocessor took 39.61ms. Allocated memory is still 176.2MB. Free memory was 138.7MB in the beginning and 136.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:26:57,000 INFO L158 Benchmark]: RCFGBuilder took 319.14ms. Allocated memory is still 176.2MB. Free memory was 136.6MB in the beginning and 145.5MB in the end (delta: -9.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2024-11-09 11:26:57,000 INFO L158 Benchmark]: TraceAbstraction took 13731.04ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 144.5MB in the beginning and 164.0MB in the end (delta: -19.5MB). Peak memory consumption was 130.7MB. Max. memory is 16.1GB. [2024-11-09 11:26:57,000 INFO L158 Benchmark]: Witness Printer took 87.64ms. Allocated memory is still 213.9MB. Free memory was 164.0MB in the beginning and 158.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:26:57,002 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.20ms. Allocated memory is still 176.2MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.38ms. Allocated memory is still 176.2MB. Free memory was 99.5MB in the beginning and 139.7MB in the end (delta: -40.2MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.85ms. Allocated memory is still 176.2MB. Free memory was 139.7MB in the beginning and 138.7MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.61ms. Allocated memory is still 176.2MB. Free memory was 138.7MB in the beginning and 136.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 319.14ms. Allocated memory is still 176.2MB. Free memory was 136.6MB in the beginning and 145.5MB in the end (delta: -9.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13731.04ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 144.5MB in the beginning and 164.0MB in the end (delta: -19.5MB). Peak memory consumption was 130.7MB. Max. memory is 16.1GB. * Witness Printer took 87.64ms. Allocated memory is still 213.9MB. Free memory was 164.0MB in the beginning and 158.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 16, TraceHistogramMax: 40, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319 mSDsluCounter, 2687 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2092 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2317 IncrementalHoareTripleChecker+Invalid, 2450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 595 mSDtfsCounter, 2317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2587 GetRequests, 2347 SyntacticMatches, 7 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1889 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=13, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 237 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2524 NumberOfCodeBlocks, 2524 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3343 ConstructedInterpolants, 0 QuantifiedInterpolants, 6523 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2442 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 21536/23131 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 12 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((i == 0) || ((1 <= i) && (i <= 2147483646))) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((((i == 1) && (j == 1)) || ((2 == j) && (2 == i))) || (((3 == j) && (i <= 2147483643)) && (j <= i))) || ((i == 0) && (j == 0))) || (((1 <= i) && (i <= 3)) && (j == 0))) || (((i <= 4) && (2 <= i)) && (j == 1))) || ((((i <= 2147483644) && (j <= 2147483643)) && (4 <= j)) && (j <= i))) || (((2 == j) && (3 <= i)) && (i <= 5))) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:26:57,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE