./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound100.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa72233183b4e91144bd6a6eb8a8b140b7f90e590c3e855f829f337fec510ab9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:56:42,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:56:42,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:56:42,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:56:42,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:56:42,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:56:42,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:56:42,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:56:42,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:56:42,205 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:56:42,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:56:42,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:56:42,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:56:42,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:56:42,208 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:56:42,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:56:42,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:56:42,212 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:56:42,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:56:42,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:56:42,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:56:42,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:56:42,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:56:42,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:56:42,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:56:42,214 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:56:42,215 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:56:42,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:56:42,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:56:42,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:56:42,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:56:42,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:56:42,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:56:42,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:56:42,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:56:42,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:56:42,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:56:42,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:56:42,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:56:42,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:56:42,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:56:42,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:56:42,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:56:42,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:56:42,220 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa72233183b4e91144bd6a6eb8a8b140b7f90e590c3e855f829f337fec510ab9 [2024-10-11 20:56:42,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:56:42,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:56:42,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:56:42,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:56:42,482 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:56:42,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound100.c [2024-10-11 20:56:44,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:56:44,195 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:56:44,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound100.c [2024-10-11 20:56:44,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/18c691841/fac4b137f7c94149b9a9fe26487b04d5/FLAG87cb1288c [2024-10-11 20:56:44,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/18c691841/fac4b137f7c94149b9a9fe26487b04d5 [2024-10-11 20:56:44,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:56:44,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:56:44,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:56:44,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:56:44,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:56:44,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fed6845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44, skipping insertion in model container [2024-10-11 20:56:44,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:56:44,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:56:44,837 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:56:44,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:56:44,887 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:56:44,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44 WrapperNode [2024-10-11 20:56:44,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:56:44,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:56:44,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:56:44,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:56:44,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,923 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-10-11 20:56:44,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:56:44,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:56:44,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:56:44,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:56:44,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,963 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:56:44,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:56:44,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:56:44,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:56:44,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:56:44,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (1/1) ... [2024-10-11 20:56:44,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:56:45,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:45,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:56:45,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:56:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:56:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:56:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:56:45,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:56:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:56:45,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:56:45,112 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:56:45,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:56:45,283 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 20:56:45,283 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:56:45,319 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:56:45,319 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:56:45,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:56:45 BoogieIcfgContainer [2024-10-11 20:56:45,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:56:45,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:56:45,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:56:45,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:56:45,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:56:44" (1/3) ... [2024-10-11 20:56:45,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3501366e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:56:45, skipping insertion in model container [2024-10-11 20:56:45,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:44" (2/3) ... [2024-10-11 20:56:45,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3501366e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:56:45, skipping insertion in model container [2024-10-11 20:56:45,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:56:45" (3/3) ... [2024-10-11 20:56:45,331 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound100.c [2024-10-11 20:56:45,346 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:56:45,346 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:56:45,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:56:45,412 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;@56a84006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:56:45,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:56:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:56:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:56:45,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:45,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:56:45,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:45,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash 118368741, now seen corresponding path program 1 times [2024-10-11 20:56:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:45,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203313322] [2024-10-11 20:56:45,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:56:45,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:45,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203313322] [2024-10-11 20:56:45,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203313322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:45,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:56:45,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:56:45,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571548751] [2024-10-11 20:56:45,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:45,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:56:45,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:45,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:56:45,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:56:45,720 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:56:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:45,757 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2024-10-11 20:56:45,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:56:45,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:56:45,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:45,766 INFO L225 Difference]: With dead ends: 60 [2024-10-11 20:56:45,767 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 20:56:45,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:56:45,776 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:45,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 20:56:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 20:56:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:56:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-10-11 20:56:45,822 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 5 [2024-10-11 20:56:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:45,823 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-10-11 20:56:45,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:56:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-10-11 20:56:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:56:45,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:45,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:56:45,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:56:45,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:45,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash 118428323, now seen corresponding path program 1 times [2024-10-11 20:56:45,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:45,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479774014] [2024-10-11 20:56:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:45,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:56:45,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479774014] [2024-10-11 20:56:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479774014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:45,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:56:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:56:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750428499] [2024-10-11 20:56:45,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:45,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:56:45,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:45,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:56:45,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:56:45,977 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:56:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:46,057 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-10-11 20:56:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:56:46,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:56:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:46,060 INFO L225 Difference]: With dead ends: 47 [2024-10-11 20:56:46,060 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 20:56:46,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:56:46,061 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:46,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 81 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 20:56:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 20:56:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:56:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-11 20:56:46,075 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 5 [2024-10-11 20:56:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:46,076 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-11 20:56:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:56:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-11 20:56:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:56:46,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:46,078 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:46,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:56:46,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:46,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:46,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1994096058, now seen corresponding path program 1 times [2024-10-11 20:56:46,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:46,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381617334] [2024-10-11 20:56:46,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:46,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:46,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:46,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381617334] [2024-10-11 20:56:46,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381617334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:46,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:56:46,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:56:46,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434189722] [2024-10-11 20:56:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:46,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:56:46,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:46,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:56:46,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:56:46,341 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:46,457 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2024-10-11 20:56:46,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:56:46,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-11 20:56:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:46,461 INFO L225 Difference]: With dead ends: 54 [2024-10-11 20:56:46,461 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 20:56:46,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:56:46,462 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:46,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 113 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:56:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 20:56:46,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2024-10-11 20:56:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:56:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-10-11 20:56:46,485 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 25 [2024-10-11 20:56:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:46,485 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-10-11 20:56:46,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-10-11 20:56:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:56:46,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:46,486 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:46,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:56:46,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:46,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1994094904, now seen corresponding path program 1 times [2024-10-11 20:56:46,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:46,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020726083] [2024-10-11 20:56:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:46,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:46,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020726083] [2024-10-11 20:56:46,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020726083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:46,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555675250] [2024-10-11 20:56:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:46,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:46,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:46,658 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:46,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:56:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:56:46,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:46,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:56:46,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555675250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:46,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:56:46,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-10-11 20:56:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275932680] [2024-10-11 20:56:46,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:46,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:56:46,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:46,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:56:46,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:56:46,845 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:46,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:46,917 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2024-10-11 20:56:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:56:46,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-11 20:56:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:46,922 INFO L225 Difference]: With dead ends: 63 [2024-10-11 20:56:46,922 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 20:56:46,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:56:46,926 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:46,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 20:56:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2024-10-11 20:56:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:56:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2024-10-11 20:56:46,944 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 25 [2024-10-11 20:56:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:46,945 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2024-10-11 20:56:46,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2024-10-11 20:56:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 20:56:46,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:46,946 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:46,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:56:47,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:47,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:47,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1687435582, now seen corresponding path program 1 times [2024-10-11 20:56:47,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:47,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787142031] [2024-10-11 20:56:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:47,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:47,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:47,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:47,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:47,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:47,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787142031] [2024-10-11 20:56:47,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787142031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:47,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:56:47,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:56:47,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824802557] [2024-10-11 20:56:47,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:47,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:56:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:47,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:56:47,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:56:47,286 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:47,357 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2024-10-11 20:56:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:56:47,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-10-11 20:56:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:47,359 INFO L225 Difference]: With dead ends: 63 [2024-10-11 20:56:47,361 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 20:56:47,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:56:47,362 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:47,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 110 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 20:56:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2024-10-11 20:56:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:56:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2024-10-11 20:56:47,381 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 26 [2024-10-11 20:56:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:47,381 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2024-10-11 20:56:47,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2024-10-11 20:56:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 20:56:47,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:47,384 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:47,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:56:47,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:47,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1687399832, now seen corresponding path program 1 times [2024-10-11 20:56:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179271137] [2024-10-11 20:56:47,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:47,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:47,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179271137] [2024-10-11 20:56:47,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179271137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:47,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211367700] [2024-10-11 20:56:47,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:47,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:47,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:47,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:47,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:56:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:47,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:56:47,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:47,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:47,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211367700] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:47,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:47,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 12 [2024-10-11 20:56:47,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369116612] [2024-10-11 20:56:47,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:47,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:56:47,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:56:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:56:47,755 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 20:56:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:47,927 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2024-10-11 20:56:47,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:56:47,928 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 26 [2024-10-11 20:56:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:47,929 INFO L225 Difference]: With dead ends: 109 [2024-10-11 20:56:47,929 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 20:56:47,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:56:47,930 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 66 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:47,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 161 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:56:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 20:56:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2024-10-11 20:56:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 61 states have internal predecessors, (71), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 20:56:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2024-10-11 20:56:47,947 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 26 [2024-10-11 20:56:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:47,948 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-10-11 20:56:47,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 20:56:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2024-10-11 20:56:47,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 20:56:47,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:47,949 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:47,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:56:48,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:48,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:48,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:48,151 INFO L85 PathProgramCache]: Analyzing trace with hash -339875692, now seen corresponding path program 1 times [2024-10-11 20:56:48,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:48,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359731620] [2024-10-11 20:56:48,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:48,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:48,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:48,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:48,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:56:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359731620] [2024-10-11 20:56:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359731620] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87136254] [2024-10-11 20:56:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:48,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:48,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:48,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:48,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:56:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:48,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:56:48,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:56:48,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:56:48,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87136254] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:48,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:48,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2024-10-11 20:56:48,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947556084] [2024-10-11 20:56:48,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:48,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 20:56:48,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:48,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 20:56:48,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:56:48,575 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 20:56:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:48,845 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2024-10-11 20:56:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 20:56:48,845 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 42 [2024-10-11 20:56:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:48,847 INFO L225 Difference]: With dead ends: 138 [2024-10-11 20:56:48,847 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 20:56:48,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-10-11 20:56:48,848 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:48,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 201 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:56:48,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 20:56:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-10-11 20:56:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.183673469387755) internal successors, (116), 100 states have internal predecessors, (116), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 20:56:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2024-10-11 20:56:48,875 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 42 [2024-10-11 20:56:48,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:48,875 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2024-10-11 20:56:48,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 20:56:48,876 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2024-10-11 20:56:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:56:48,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:48,877 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] [2024-10-11 20:56:48,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:56:49,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:49,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:49,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:49,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1343451627, now seen corresponding path program 1 times [2024-10-11 20:56:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:49,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483462399] [2024-10-11 20:56:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:49,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:56:49,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:49,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483462399] [2024-10-11 20:56:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483462399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:49,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424527627] [2024-10-11 20:56:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:49,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:49,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:49,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:49,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:56:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:56:49,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:56:49,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:56:49,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424527627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:49,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:56:49,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-10-11 20:56:49,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402156921] [2024-10-11 20:56:49,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:49,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:56:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:49,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:56:49,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:56:49,379 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:56:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:49,494 INFO L93 Difference]: Finished difference Result 136 states and 164 transitions. [2024-10-11 20:56:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:56:49,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-10-11 20:56:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:49,496 INFO L225 Difference]: With dead ends: 136 [2024-10-11 20:56:49,496 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 20:56:49,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:56:49,497 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 44 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:49,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 182 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:56:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 20:56:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107. [2024-10-11 20:56:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.155844155844156) internal successors, (89), 78 states have internal predecessors, (89), 20 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:56:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2024-10-11 20:56:49,510 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 45 [2024-10-11 20:56:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:49,511 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2024-10-11 20:56:49,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:56:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2024-10-11 20:56:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 20:56:49,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:49,512 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:49,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:56:49,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:56:49,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:49,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash -597482282, now seen corresponding path program 1 times [2024-10-11 20:56:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:49,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040226192] [2024-10-11 20:56:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:56:49,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:49,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040226192] [2024-10-11 20:56:49,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040226192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:49,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666780308] [2024-10-11 20:56:49,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:49,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:49,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:49,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:49,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:56:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:49,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:56:49,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:56:49,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:56:50,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666780308] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:50,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:50,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 17 [2024-10-11 20:56:50,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990888170] [2024-10-11 20:56:50,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:50,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 20:56:50,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:50,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 20:56:50,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:56:50,067 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 20:56:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:50,295 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions. [2024-10-11 20:56:50,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 20:56:50,295 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 50 [2024-10-11 20:56:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:50,297 INFO L225 Difference]: With dead ends: 161 [2024-10-11 20:56:50,297 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 20:56:50,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=474, Unknown=0, NotChecked=0, Total=702 [2024-10-11 20:56:50,298 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 78 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:50,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 196 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:56:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 20:56:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2024-10-11 20:56:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 95 states have internal predecessors, (107), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 20:56:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 159 transitions. [2024-10-11 20:56:50,314 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 159 transitions. Word has length 50 [2024-10-11 20:56:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:50,314 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 159 transitions. [2024-10-11 20:56:50,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 20:56:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 159 transitions. [2024-10-11 20:56:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 20:56:50,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:50,320 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:50,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:56:50,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:50,526 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:50,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1181186760, now seen corresponding path program 1 times [2024-10-11 20:56:50,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:50,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342080054] [2024-10-11 20:56:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:50,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:50,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:50,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:50,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:50,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:50,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:50,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 20:56:50,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342080054] [2024-10-11 20:56:50,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342080054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27501208] [2024-10-11 20:56:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:50,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:50,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:50,747 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:50,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:56:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:50,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:56:50,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 20:56:50,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 20:56:51,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27501208] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:51,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:51,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 20 [2024-10-11 20:56:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601358849] [2024-10-11 20:56:51,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:51,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 20:56:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 20:56:51,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:56:51,060 INFO L87 Difference]: Start difference. First operand 132 states and 159 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 6 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2024-10-11 20:56:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:51,451 INFO L93 Difference]: Finished difference Result 184 states and 222 transitions. [2024-10-11 20:56:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 20:56:51,452 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 6 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) Word has length 66 [2024-10-11 20:56:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:51,454 INFO L225 Difference]: With dead ends: 184 [2024-10-11 20:56:51,454 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 20:56:51,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=373, Invalid=1187, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 20:56:51,457 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 112 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:51,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 265 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:56:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 20:56:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 140. [2024-10-11 20:56:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 99 states have internal predecessors, (112), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 20:56:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2024-10-11 20:56:51,475 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 66 [2024-10-11 20:56:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:51,476 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2024-10-11 20:56:51,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 6 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2024-10-11 20:56:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2024-10-11 20:56:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 20:56:51,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:51,478 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:51,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:56:51,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:56:51,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:51,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:51,679 INFO L85 PathProgramCache]: Analyzing trace with hash -982876319, now seen corresponding path program 1 times [2024-10-11 20:56:51,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:51,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522495377] [2024-10-11 20:56:51,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:51,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:51,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:51,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:51,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:51,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:51,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:56:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:51,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:56:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 20:56:51,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:51,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522495377] [2024-10-11 20:56:51,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522495377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:51,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220915000] [2024-10-11 20:56:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:51,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:51,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:51,960 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:51,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:56:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:52,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:56:52,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 20:56:52,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 20:56:52,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220915000] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:52,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:52,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 24 [2024-10-11 20:56:52,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145816219] [2024-10-11 20:56:52,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:52,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 20:56:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:52,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 20:56:52,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:56:52,342 INFO L87 Difference]: Start difference. First operand 140 states and 170 transitions. Second operand has 25 states, 24 states have (on average 3.25) internal successors, (78), 25 states have internal predecessors, (78), 8 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2024-10-11 20:56:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:52,791 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2024-10-11 20:56:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 20:56:52,791 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 25 states have internal predecessors, (78), 8 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) Word has length 78 [2024-10-11 20:56:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:52,793 INFO L225 Difference]: With dead ends: 225 [2024-10-11 20:56:52,796 INFO L226 Difference]: Without dead ends: 224 [2024-10-11 20:56:52,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=485, Invalid=1585, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 20:56:52,798 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 129 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:52,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 180 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:56:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-11 20:56:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 164. [2024-10-11 20:56:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 116 states have (on average 1.1379310344827587) internal successors, (132), 117 states have internal predecessors, (132), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 20:56:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2024-10-11 20:56:52,819 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 78 [2024-10-11 20:56:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:52,821 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2024-10-11 20:56:52,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 25 states have internal predecessors, (78), 8 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2024-10-11 20:56:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2024-10-11 20:56:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 20:56:52,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:52,826 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2024-10-11 20:56:52,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:56:53,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:53,031 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:53,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:53,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2071083694, now seen corresponding path program 2 times [2024-10-11 20:56:53,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:53,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268362409] [2024-10-11 20:56:53,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:53,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:56:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:56:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 20:56:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 20:56:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:56:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:56:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 20:56:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268362409] [2024-10-11 20:56:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268362409] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077321126] [2024-10-11 20:56:53,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:56:53,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:53,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:53,419 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:53,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:56:53,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:56:53,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:56:53,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 20:56:53,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 20:56:53,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 20:56:53,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077321126] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:53,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:53,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 32 [2024-10-11 20:56:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910561018] [2024-10-11 20:56:53,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:53,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 20:56:53,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:53,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 20:56:53,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 20:56:53,981 INFO L87 Difference]: Start difference. First operand 164 states and 198 transitions. Second operand has 33 states, 32 states have (on average 3.3125) internal successors, (106), 33 states have internal predecessors, (106), 12 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 12 states have call predecessors, (45), 12 states have call successors, (45) [2024-10-11 20:56:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:54,704 INFO L93 Difference]: Finished difference Result 292 states and 348 transitions. [2024-10-11 20:56:54,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-11 20:56:54,705 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.3125) internal successors, (106), 33 states have internal predecessors, (106), 12 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 12 states have call predecessors, (45), 12 states have call successors, (45) Word has length 114 [2024-10-11 20:56:54,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:54,707 INFO L225 Difference]: With dead ends: 292 [2024-10-11 20:56:54,707 INFO L226 Difference]: Without dead ends: 291 [2024-10-11 20:56:54,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=922, Invalid=3110, Unknown=0, NotChecked=0, Total=4032 [2024-10-11 20:56:54,709 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 165 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:54,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 346 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:56:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-11 20:56:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 188. [2024-10-11 20:56:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 134 states have (on average 1.1343283582089552) internal successors, (152), 135 states have internal predecessors, (152), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 20:56:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 226 transitions. [2024-10-11 20:56:54,724 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 226 transitions. Word has length 114 [2024-10-11 20:56:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:54,724 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 226 transitions. [2024-10-11 20:56:54,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.3125) internal successors, (106), 33 states have internal predecessors, (106), 12 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 12 states have call predecessors, (45), 12 states have call successors, (45) [2024-10-11 20:56:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 226 transitions. [2024-10-11 20:56:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 20:56:54,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:54,726 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-10-11 20:56:54,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:56:54,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:56:54,927 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:54,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1254225999, now seen corresponding path program 2 times [2024-10-11 20:56:54,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:54,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626206300] [2024-10-11 20:56:54,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:54,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:56:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:56:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:56:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:56:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:56:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:56:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:56:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:56:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:56:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 20:56:55,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:55,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626206300] [2024-10-11 20:56:55,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626206300] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:55,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107536765] [2024-10-11 20:56:55,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:56:55,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:55,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:55,296 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:55,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:56:55,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:56:55,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:56:55,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 20:56:55,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 678 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 20:56:55,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 20:56:55,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107536765] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:55,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:55,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 32 [2024-10-11 20:56:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135679658] [2024-10-11 20:56:55,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:55,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 20:56:55,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:55,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 20:56:55,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=755, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 20:56:55,874 INFO L87 Difference]: Start difference. First operand 188 states and 226 transitions. Second operand has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 12 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 12 states have call predecessors, (54), 12 states have call successors, (54) [2024-10-11 20:56:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:56,571 INFO L93 Difference]: Finished difference Result 332 states and 407 transitions. [2024-10-11 20:56:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-11 20:56:56,572 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 12 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 12 states have call predecessors, (54), 12 states have call successors, (54) Word has length 126 [2024-10-11 20:56:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:56,576 INFO L225 Difference]: With dead ends: 332 [2024-10-11 20:56:56,577 INFO L226 Difference]: Without dead ends: 318 [2024-10-11 20:56:56,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1084, Invalid=2338, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 20:56:56,579 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 259 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:56,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 275 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:56:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-11 20:56:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 275. [2024-10-11 20:56:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 193 states have (on average 1.160621761658031) internal successors, (224), 194 states have internal predecessors, (224), 58 states have call successors, (58), 22 states have call predecessors, (58), 22 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 20:56:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 340 transitions. [2024-10-11 20:56:56,602 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 340 transitions. Word has length 126 [2024-10-11 20:56:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:56,602 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 340 transitions. [2024-10-11 20:56:56,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 12 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 12 states have call predecessors, (54), 12 states have call successors, (54) [2024-10-11 20:56:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 340 transitions. [2024-10-11 20:56:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 20:56:56,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:56,604 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:56,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:56:56,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:56,809 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:56,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:56,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1500608548, now seen corresponding path program 2 times [2024-10-11 20:56:56,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:56,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233176750] [2024-10-11 20:56:56,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:56,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:56:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:56:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:56:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:56:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:56:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:56:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:56:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:56:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:56:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 20:56:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 20:56:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:56:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 20:56:57,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:57,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233176750] [2024-10-11 20:56:57,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233176750] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:57,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816946144] [2024-10-11 20:56:57,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:56:57,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:57,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:57,228 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:57,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:56:57,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:56:57,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:56:57,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:56:57,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-10-11 20:56:57,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:56:57,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816946144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:57,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:56:57,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 21 [2024-10-11 20:56:57,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162396349] [2024-10-11 20:56:57,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:57,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:56:57,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:57,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:56:57,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:56:57,346 INFO L87 Difference]: Start difference. First operand 275 states and 340 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:56:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:57,421 INFO L93 Difference]: Finished difference Result 284 states and 349 transitions. [2024-10-11 20:56:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:56:57,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 146 [2024-10-11 20:56:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:57,423 INFO L225 Difference]: With dead ends: 284 [2024-10-11 20:56:57,423 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 20:56:57,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:56:57,424 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 68 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:57,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 68 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 20:56:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2024-10-11 20:56:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 193 states have (on average 1.160621761658031) internal successors, (224), 194 states have internal predecessors, (224), 58 states have call successors, (58), 22 states have call predecessors, (58), 22 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 20:56:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 340 transitions. [2024-10-11 20:56:57,443 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 340 transitions. Word has length 146 [2024-10-11 20:56:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:57,444 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 340 transitions. [2024-10-11 20:56:57,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:56:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 340 transitions. [2024-10-11 20:56:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 20:56:57,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:57,446 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:57,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 20:56:57,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:56:57,647 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:57,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:57,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2047916611, now seen corresponding path program 2 times [2024-10-11 20:56:57,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:57,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341515896] [2024-10-11 20:56:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:57,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:56:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:56:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:56:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:56:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:56:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:56:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:56:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:56:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:56:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 20:56:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 20:56:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:56:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 20:56:58,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:58,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341515896] [2024-10-11 20:56:58,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341515896] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:58,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277089051] [2024-10-11 20:56:58,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:56:58,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:58,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:58,077 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:58,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:56:58,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:56:58,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:56:58,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 20:56:58,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 0 proven. 952 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 20:56:58,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 20:56:58,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277089051] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:58,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 41 [2024-10-11 20:56:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082631047] [2024-10-11 20:56:58,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:58,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 20:56:58,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 20:56:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 20:56:58,863 INFO L87 Difference]: Start difference. First operand 275 states and 340 transitions. Second operand has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 states have internal predecessors, (126), 14 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 14 states have call predecessors, (63), 14 states have call successors, (63) [2024-10-11 20:56:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:59,854 INFO L93 Difference]: Finished difference Result 419 states and 512 transitions. [2024-10-11 20:56:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 20:56:59,854 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 states have internal predecessors, (126), 14 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 14 states have call predecessors, (63), 14 states have call successors, (63) Word has length 150 [2024-10-11 20:56:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:59,857 INFO L225 Difference]: With dead ends: 419 [2024-10-11 20:56:59,857 INFO L226 Difference]: Without dead ends: 405 [2024-10-11 20:56:59,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1903, Invalid=6107, Unknown=0, NotChecked=0, Total=8010 [2024-10-11 20:56:59,860 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 347 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:59,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 289 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:56:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-11 20:56:59,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 300. [2024-10-11 20:56:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 210 states have (on average 1.1666666666666667) internal successors, (245), 211 states have internal predecessors, (245), 64 states have call successors, (64), 24 states have call predecessors, (64), 24 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 20:56:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 373 transitions. [2024-10-11 20:56:59,899 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 373 transitions. Word has length 150 [2024-10-11 20:56:59,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:59,900 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 373 transitions. [2024-10-11 20:56:59,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 states have internal predecessors, (126), 14 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 14 states have call predecessors, (63), 14 states have call successors, (63) [2024-10-11 20:56:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 373 transitions. [2024-10-11 20:56:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 20:56:59,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:59,902 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2024-10-11 20:56:59,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 20:57:00,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:57:00,106 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:57:00,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2087789957, now seen corresponding path program 3 times [2024-10-11 20:57:00,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:00,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942542840] [2024-10-11 20:57:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:00,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:57:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:57:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:57:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:57:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:57:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:57:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:57:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:57:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:57:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:57:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:57:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:57:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 20:57:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:57:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 20:57:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:57:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 20:57:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 20:57:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 20:57:00,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942542840] [2024-10-11 20:57:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942542840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:00,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559406612] [2024-10-11 20:57:00,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:57:00,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:00,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:00,567 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:57:00,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 20:57:00,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 20:57:00,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:57:00,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:57:00,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2024-10-11 20:57:00,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:57:00,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559406612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:00,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:00,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 23 [2024-10-11 20:57:00,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386008230] [2024-10-11 20:57:00,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:00,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:57:00,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:00,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:57:00,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:57:00,700 INFO L87 Difference]: Start difference. First operand 300 states and 373 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:57:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:00,767 INFO L93 Difference]: Finished difference Result 316 states and 389 transitions. [2024-10-11 20:57:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:57:00,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 150 [2024-10-11 20:57:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:00,769 INFO L225 Difference]: With dead ends: 316 [2024-10-11 20:57:00,769 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 20:57:00,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2024-10-11 20:57:00,771 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:00,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:57:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 20:57:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-10-11 20:57:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 139 states have internal predecessors, (140), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 20:57:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 236 transitions. [2024-10-11 20:57:00,786 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 236 transitions. Word has length 150 [2024-10-11 20:57:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:00,787 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 236 transitions. [2024-10-11 20:57:00,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:57:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 236 transitions. [2024-10-11 20:57:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-10-11 20:57:00,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:00,790 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1] [2024-10-11 20:57:00,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 20:57:00,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 20:57:00,991 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:57:00,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:00,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1616045469, now seen corresponding path program 3 times [2024-10-11 20:57:00,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295297161] [2024-10-11 20:57:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:00,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:57:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:57:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:57:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:57:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:57:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:57:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:57:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:57:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:57:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:57:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:57:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:57:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:57:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:57:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:57:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:57:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 20:57:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 20:57:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:57:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 20:57:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:57:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 20:57:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 20:57:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 20:57:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 20:57:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 20:57:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 20:57:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 20:57:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 20:57:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 20:57:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 20:57:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-11 20:57:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 20:57:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 20:57:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-11 20:57:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 20:57:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 20:57:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 20:57:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-11 20:57:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 20:57:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-11 20:57:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-10-11 20:57:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 20:57:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-10-11 20:57:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-10-11 20:57:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-11 20:57:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5520 backedges. 0 proven. 1008 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-10-11 20:57:02,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:02,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295297161] [2024-10-11 20:57:02,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295297161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:02,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167431689] [2024-10-11 20:57:02,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:57:02,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:02,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:02,297 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:57:02,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 20:57:02,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 20:57:02,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:57:02,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:57:02,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5520 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 4857 trivial. 0 not checked. [2024-10-11 20:57:02,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:57:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167431689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:02,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:02,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [36] total 39 [2024-10-11 20:57:02,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291547026] [2024-10-11 20:57:02,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:02,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:57:02,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:02,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:57:02,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 20:57:02,460 INFO L87 Difference]: Start difference. First operand 204 states and 236 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:57:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:02,532 INFO L93 Difference]: Finished difference Result 204 states and 236 transitions. [2024-10-11 20:57:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:57:02,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2024-10-11 20:57:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:02,536 INFO L225 Difference]: With dead ends: 204 [2024-10-11 20:57:02,537 INFO L226 Difference]: Without dead ends: 203 [2024-10-11 20:57:02,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=431, Invalid=1291, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 20:57:02,538 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:02,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 40 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:57:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-11 20:57:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-10-11 20:57:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 138 states have (on average 1.0072463768115942) internal successors, (139), 138 states have internal predecessors, (139), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 20:57:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 235 transitions. [2024-10-11 20:57:02,552 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 235 transitions. Word has length 326 [2024-10-11 20:57:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:02,553 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 235 transitions. [2024-10-11 20:57:02,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:57:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 235 transitions. [2024-10-11 20:57:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-11 20:57:02,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:02,557 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:02,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 20:57:02,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:57:02,758 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:57:02,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1961556464, now seen corresponding path program 3 times [2024-10-11 20:57:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:02,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063060898] [2024-10-11 20:57:02,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:57:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:57:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:57:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:57:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:57:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:57:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:57:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:57:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:57:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:57:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:57:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:57:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:57:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:57:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:57:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:57:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 20:57:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 20:57:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:57:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 20:57:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:57:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 20:57:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 20:57:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 20:57:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 20:57:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 20:57:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 20:57:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 20:57:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 20:57:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 20:57:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 20:57:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-11 20:57:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 20:57:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 20:57:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-11 20:57:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 20:57:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 20:57:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 20:57:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-11 20:57:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 20:57:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-11 20:57:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-10-11 20:57:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 20:57:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:03,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-10-11 20:57:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:04,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-10-11 20:57:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:04,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-11 20:57:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5536 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-10-11 20:57:04,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:04,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063060898] [2024-10-11 20:57:04,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063060898] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:04,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418852494] [2024-10-11 20:57:04,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:57:04,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:04,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:04,013 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:57:04,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 20:57:04,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 20:57:04,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:57:04,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:57:04,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5536 backedges. 678 proven. 1 refuted. 0 times theorem prover too weak. 4857 trivial. 0 not checked. [2024-10-11 20:57:04,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5536 backedges. 138 proven. 1 refuted. 0 times theorem prover too weak. 5397 trivial. 0 not checked. [2024-10-11 20:57:04,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418852494] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:57:04,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:57:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 6, 6] total 47 [2024-10-11 20:57:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533453904] [2024-10-11 20:57:04,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:04,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-11 20:57:04,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:04,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-11 20:57:04,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=1627, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 20:57:04,555 INFO L87 Difference]: Start difference. First operand 203 states and 235 transitions. Second operand has 47 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 47 states have internal predecessors, (124), 19 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 19 states have call predecessors, (57), 19 states have call successors, (57) [2024-10-11 20:57:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:05,496 INFO L93 Difference]: Finished difference Result 218 states and 253 transitions. [2024-10-11 20:57:05,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-11 20:57:05,497 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 47 states have internal predecessors, (124), 19 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 19 states have call predecessors, (57), 19 states have call successors, (57) Word has length 330 [2024-10-11 20:57:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:05,497 INFO L225 Difference]: With dead ends: 218 [2024-10-11 20:57:05,497 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:57:05,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2084, Invalid=4722, Unknown=0, NotChecked=0, Total=6806 [2024-10-11 20:57:05,501 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 337 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:05,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 134 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:57:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:57:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:57:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:57:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:57:05,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 330 [2024-10-11 20:57:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:05,502 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:57:05,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 47 states have internal predecessors, (124), 19 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 19 states have call predecessors, (57), 19 states have call successors, (57) [2024-10-11 20:57:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:57:05,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:57:05,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:57:05,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:57:05,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:57:05,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:57:05,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-11 20:57:05,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:57:05,709 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:05,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:57:08,941 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:57:08,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:57:08 BoogieIcfgContainer [2024-10-11 20:57:08,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:57:08,956 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:57:08,956 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:57:08,956 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:57:08,957 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:56:45" (3/4) ... [2024-10-11 20:57:08,959 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:57:08,962 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:57:08,966 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 20:57:08,966 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 20:57:08,966 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:57:08,966 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:57:09,059 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:57:09,060 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:57:09,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:57:09,062 INFO L158 Benchmark]: Toolchain (without parser) took 24468.84ms. Allocated memory was 155.2MB in the beginning and 406.8MB in the end (delta: 251.7MB). Free memory was 99.8MB in the beginning and 188.2MB in the end (delta: -88.4MB). Peak memory consumption was 166.1MB. Max. memory is 16.1GB. [2024-10-11 20:57:09,062 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 155.2MB. Free memory was 117.1MB in the beginning and 116.9MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:57:09,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.15ms. Allocated memory is still 155.2MB. Free memory was 99.8MB in the beginning and 87.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:57:09,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.12ms. Allocated memory is still 155.2MB. Free memory was 87.7MB in the beginning and 86.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:57:09,063 INFO L158 Benchmark]: Boogie Preprocessor took 53.80ms. Allocated memory is still 155.2MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:57:09,063 INFO L158 Benchmark]: RCFGBuilder took 339.31ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 70.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:57:09,063 INFO L158 Benchmark]: TraceAbstraction took 23633.68ms. Allocated memory was 155.2MB in the beginning and 406.8MB in the end (delta: 251.7MB). Free memory was 70.5MB in the beginning and 193.5MB in the end (delta: -123.0MB). Peak memory consumption was 193.4MB. Max. memory is 16.1GB. [2024-10-11 20:57:09,064 INFO L158 Benchmark]: Witness Printer took 103.95ms. Allocated memory is still 406.8MB. Free memory was 193.5MB in the beginning and 188.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:57:09,065 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.08ms. Allocated memory is still 155.2MB. Free memory was 117.1MB in the beginning and 116.9MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.15ms. Allocated memory is still 155.2MB. Free memory was 99.8MB in the beginning and 87.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.12ms. Allocated memory is still 155.2MB. Free memory was 87.7MB in the beginning and 86.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.80ms. Allocated memory is still 155.2MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 339.31ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 70.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23633.68ms. Allocated memory was 155.2MB in the beginning and 406.8MB in the end (delta: 251.7MB). Free memory was 70.5MB in the beginning and 193.5MB in the end (delta: -123.0MB). Peak memory consumption was 193.4MB. Max. memory is 16.1GB. * Witness Printer took 103.95ms. Allocated memory is still 406.8MB. Free memory was 193.5MB in the beginning and 188.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: 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, 31 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 18, TraceHistogramMax: 48, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1677 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1677 mSDsluCounter, 2855 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2400 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2264 IncrementalHoareTripleChecker+Invalid, 2503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 455 mSDtfsCounter, 2264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3560 GetRequests, 2995 SyntacticMatches, 0 SemanticMatches, 565 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7226 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300occurred in iteration=15, InterpolantAutomatonStates: 400, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 436 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 3409 NumberOfCodeBlocks, 2567 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4350 ConstructedInterpolants, 0 QuantifiedInterpolants, 8110 SizeOfPredicates, 86 NumberOfNonLiveVariables, 2004 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 41 InterpolantComputations, 9 PerfectInterpolantSequences, 34212/39889 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 4 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((counter == 0) || ((2 <= counter) && (counter <= 100))) || (counter == 1)) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((1 <= counter) && (counter <= 2147483646)) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:57:09,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE