./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/fermat2-ll_valuebound2.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/fermat2-ll_valuebound2.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 40704d62e6828e524eeb24a4dc1771a4d2719fc47e6facdd014c5940cef1d5d0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:47:25,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:47:26,053 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:47:26,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:47:26,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:47:26,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:47:26,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:47:26,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:47:26,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:47:26,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:47:26,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:47:26,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:47:26,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:47:26,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:47:26,095 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:47:26,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:47:26,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:47:26,095 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:47:26,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:47:26,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:47:26,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:47:26,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:47:26,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:47:26,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:47:26,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:47:26,102 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:47:26,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:47:26,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:47:26,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:47:26,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:47:26,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:47:26,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:47:26,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:47:26,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:47:26,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:47:26,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:47:26,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:47:26,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:47:26,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:47:26,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:47:26,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:47:26,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:47:26,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:47:26,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:47:26,107 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 -> 40704d62e6828e524eeb24a4dc1771a4d2719fc47e6facdd014c5940cef1d5d0 [2024-10-11 20:47:26,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:47:26,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:47:26,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:47:26,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:47:26,366 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:47:26,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound2.c [2024-10-11 20:47:27,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:47:27,974 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:47:27,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound2.c [2024-10-11 20:47:27,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/06ce01476/56ecffd283974cc1ae22391c5ae4080a/FLAGce5ed7b53 [2024-10-11 20:47:28,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/06ce01476/56ecffd283974cc1ae22391c5ae4080a [2024-10-11 20:47:28,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:47:28,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:47:28,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:47:28,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:47:28,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:47:28,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747bc5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28, skipping insertion in model container [2024-10-11 20:47:28,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:47:28,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:47:28,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:47:28,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:47:28,660 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:47:28,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28 WrapperNode [2024-10-11 20:47:28,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:47:28,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:47:28,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:47:28,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:47:28,671 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:47:28" (1/1) ... [2024-10-11 20:47:28,677 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:47:28" (1/1) ... [2024-10-11 20:47:28,706 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 106 [2024-10-11 20:47:28,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:47:28,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:47:28,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:47:28,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:47:28,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,759 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:47:28,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:47:28,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:47:28,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:47:28,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:47:28,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28" (1/1) ... [2024-10-11 20:47:28,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:47:28,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:28,827 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:47:28,830 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:47:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:47:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:47:28,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:47:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:47:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:47:28,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:47:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:47:28,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:47:28,937 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:47:28,941 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:47:29,377 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-10-11 20:47:29,377 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:47:29,413 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:47:29,413 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:47:29,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:47:29 BoogieIcfgContainer [2024-10-11 20:47:29,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:47:29,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:47:29,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:47:29,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:47:29,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:47:28" (1/3) ... [2024-10-11 20:47:29,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a3a8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:47:29, skipping insertion in model container [2024-10-11 20:47:29,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:28" (2/3) ... [2024-10-11 20:47:29,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a3a8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:47:29, skipping insertion in model container [2024-10-11 20:47:29,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:47:29" (3/3) ... [2024-10-11 20:47:29,426 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound2.c [2024-10-11 20:47:29,444 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:47:29,444 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2024-10-11 20:47:29,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:47:29,522 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;@1fd41510, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:47:29,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-10-11 20:47:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 68 states have (on average 1.911764705882353) internal successors, (130), 124 states have internal predecessors, (130), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:47:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:47:29,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:29,534 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:29,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:29,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:29,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2141259048, now seen corresponding path program 1 times [2024-10-11 20:47:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:29,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807952854] [2024-10-11 20:47:29,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:29,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:29,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:29,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:47:29,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:29,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807952854] [2024-10-11 20:47:29,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807952854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:29,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:29,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:29,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077519189] [2024-10-11 20:47:29,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:29,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:47:29,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:29,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:47:29,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:47:29,726 INFO L87 Difference]: Start difference. First operand has 133 states, 68 states have (on average 1.911764705882353) internal successors, (130), 124 states have internal predecessors, (130), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:29,753 INFO L93 Difference]: Finished difference Result 258 states and 287 transitions. [2024-10-11 20:47:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:47:29,756 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-10-11 20:47:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:29,762 INFO L225 Difference]: With dead ends: 258 [2024-10-11 20:47:29,762 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 20:47:29,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:47:29,768 INFO L432 NwaCegarLoop]: 130 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, 130 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:47:29,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:47:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 20:47:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-11 20:47:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 116 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2024-10-11 20:47:29,804 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 13 [2024-10-11 20:47:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:29,805 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2024-10-11 20:47:29,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2024-10-11 20:47:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:47:29,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:29,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:29,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:47:29,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:29,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1748291620, now seen corresponding path program 1 times [2024-10-11 20:47:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:29,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047596171] [2024-10-11 20:47:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:29,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:29,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:29,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:47:29,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:29,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047596171] [2024-10-11 20:47:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047596171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957588153] [2024-10-11 20:47:29,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:29,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:29,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:29,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:29,884 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:29,938 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2024-10-11 20:47:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:29,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-10-11 20:47:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:29,940 INFO L225 Difference]: With dead ends: 124 [2024-10-11 20:47:29,940 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 20:47:29,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:29,942 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:29,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 198 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:47:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 20:47:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-11 20:47:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 112 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2024-10-11 20:47:29,956 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 13 [2024-10-11 20:47:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:29,957 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2024-10-11 20:47:29,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2024-10-11 20:47:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:47:29,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:29,958 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:29,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:47:29,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:29,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1637534589, now seen corresponding path program 1 times [2024-10-11 20:47:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:29,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729633392] [2024-10-11 20:47:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:47:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729633392] [2024-10-11 20:47:30,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729633392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:30,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:30,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:30,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077874202] [2024-10-11 20:47:30,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:30,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:30,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:30,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:30,039 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:30,084 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2024-10-11 20:47:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:30,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-11 20:47:30,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:30,090 INFO L225 Difference]: With dead ends: 120 [2024-10-11 20:47:30,090 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 20:47:30,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:30,091 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:30,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 198 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:47:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 20:47:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 20:47:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 108 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2024-10-11 20:47:30,109 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 14 [2024-10-11 20:47:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:30,110 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2024-10-11 20:47:30,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2024-10-11 20:47:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:47:30,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:30,111 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:30,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:47:30,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:30,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:30,114 INFO L85 PathProgramCache]: Analyzing trace with hash -940276409, now seen corresponding path program 1 times [2024-10-11 20:47:30,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:30,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713112797] [2024-10-11 20:47:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:30,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:30,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733443049] [2024-10-11 20:47:30,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:30,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:30,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:30,157 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:47:30,158 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:47:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:47:30,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:47:30,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:30,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:30,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713112797] [2024-10-11 20:47:30,291 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733443049] [2024-10-11 20:47:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733443049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:30,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:30,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:47:30,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981512418] [2024-10-11 20:47:30,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:30,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:30,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:30,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:30,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:30,296 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:47:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:30,406 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2024-10-11 20:47:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:30,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 20:47:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:30,408 INFO L225 Difference]: With dead ends: 116 [2024-10-11 20:47:30,408 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 20:47:30,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:30,409 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:30,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 372 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 20:47:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 20:47:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 106 states have internal predecessors, (108), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2024-10-11 20:47:30,426 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 18 [2024-10-11 20:47:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:30,426 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2024-10-11 20:47:30,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:47:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2024-10-11 20:47:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:47:30,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:30,428 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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:47:30,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:47:30,629 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:47:30,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:30,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1891501742, now seen corresponding path program 1 times [2024-10-11 20:47:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:30,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307521981] [2024-10-11 20:47:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:30,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621272250] [2024-10-11 20:47:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:30,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:30,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:30,663 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:47:30,665 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:47:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:47:30,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:30,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:30,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307521981] [2024-10-11 20:47:30,961 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:30,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621272250] [2024-10-11 20:47:30,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621272250] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:30,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:47:30,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-10-11 20:47:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135398144] [2024-10-11 20:47:30,965 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:30,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:30,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:47:30,967 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:47:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:31,051 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2024-10-11 20:47:31,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:31,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-10-11 20:47:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:31,053 INFO L225 Difference]: With dead ends: 114 [2024-10-11 20:47:31,053 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 20:47:31,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:47:31,054 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 80 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:31,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 287 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 20:47:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 20:47:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 103 states have internal predecessors, (105), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2024-10-11 20:47:31,067 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 35 [2024-10-11 20:47:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:31,067 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2024-10-11 20:47:31,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:47:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2024-10-11 20:47:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 20:47:31,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:31,068 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:31,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:47:31,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:31,269 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:31,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:31,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1492988077, now seen corresponding path program 1 times [2024-10-11 20:47:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:31,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685458334] [2024-10-11 20:47:31,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:31,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:31,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685458334] [2024-10-11 20:47:31,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685458334] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175964103] [2024-10-11 20:47:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:31,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:31,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:31,575 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:47:31,576 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:47:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:47:31,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:31,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:31,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175964103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:31,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:47:31,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:47:31,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695440883] [2024-10-11 20:47:31,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:31,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:47:31,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:31,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:47:31,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:47:31,732 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:31,846 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2024-10-11 20:47:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:47:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2024-10-11 20:47:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:31,847 INFO L225 Difference]: With dead ends: 111 [2024-10-11 20:47:31,847 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 20:47:31,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:47:31,848 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 79 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:31,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 366 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 20:47:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 20:47:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 102 states have internal predecessors, (104), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2024-10-11 20:47:31,862 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 36 [2024-10-11 20:47:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:31,862 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2024-10-11 20:47:31,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2024-10-11 20:47:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:47:31,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:31,863 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:31,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:47:32,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:32,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:32,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:32,070 INFO L85 PathProgramCache]: Analyzing trace with hash -242462763, now seen corresponding path program 1 times [2024-10-11 20:47:32,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:32,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63594450] [2024-10-11 20:47:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:32,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:32,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:32,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63594450] [2024-10-11 20:47:32,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63594450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:32,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:32,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:32,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285793635] [2024-10-11 20:47:32,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:32,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:32,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:32,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:32,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:32,150 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:32,193 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2024-10-11 20:47:32,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:32,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2024-10-11 20:47:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:32,196 INFO L225 Difference]: With dead ends: 113 [2024-10-11 20:47:32,196 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 20:47:32,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:32,197 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:32,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:47:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 20:47:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 20:47:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.536231884057971) internal successors, (106), 104 states have internal predecessors, (106), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2024-10-11 20:47:32,214 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 38 [2024-10-11 20:47:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:32,215 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2024-10-11 20:47:32,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2024-10-11 20:47:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:47:32,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:32,216 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:32,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:47:32,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:32,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:32,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1073589017, now seen corresponding path program 1 times [2024-10-11 20:47:32,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:32,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077120583] [2024-10-11 20:47:32,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:32,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:32,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077120583] [2024-10-11 20:47:32,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077120583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:32,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:32,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:47:32,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820452879] [2024-10-11 20:47:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:32,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:47:32,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:32,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:47:32,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:32,291 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:32,373 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2024-10-11 20:47:32,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:47:32,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-11 20:47:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:32,374 INFO L225 Difference]: With dead ends: 114 [2024-10-11 20:47:32,374 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 20:47:32,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:32,376 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 45 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:32,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 208 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 20:47:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 20:47:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 105 states have internal predecessors, (107), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2024-10-11 20:47:32,385 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 39 [2024-10-11 20:47:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:32,385 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2024-10-11 20:47:32,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2024-10-11 20:47:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 20:47:32,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:32,390 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:32,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:47:32,391 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:32,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:32,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1078478761, now seen corresponding path program 1 times [2024-10-11 20:47:32,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:32,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247726852] [2024-10-11 20:47:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:32,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [513692757] [2024-10-11 20:47:32,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:32,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:32,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:32,408 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:47:32,424 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:47:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:47:32,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:32,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:32,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:32,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247726852] [2024-10-11 20:47:32,503 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:32,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513692757] [2024-10-11 20:47:32,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513692757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:32,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:32,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:32,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790970567] [2024-10-11 20:47:32,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:32,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:32,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:32,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:32,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:32,506 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:32,570 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2024-10-11 20:47:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:32,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-11 20:47:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:32,571 INFO L225 Difference]: With dead ends: 149 [2024-10-11 20:47:32,572 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 20:47:32,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:32,573 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 33 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:32,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 185 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 20:47:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 114. [2024-10-11 20:47:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 106 states have internal predecessors, (108), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2024-10-11 20:47:32,584 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 40 [2024-10-11 20:47:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:32,584 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2024-10-11 20:47:32,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2024-10-11 20:47:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:47:32,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:32,585 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:32,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:47:32,787 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,SelfDestructingSolverStorable8 [2024-10-11 20:47:32,787 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:32,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:32,787 INFO L85 PathProgramCache]: Analyzing trace with hash 926896859, now seen corresponding path program 1 times [2024-10-11 20:47:32,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:32,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653455069] [2024-10-11 20:47:32,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:32,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,031 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:47:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:33,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653455069] [2024-10-11 20:47:33,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653455069] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:33,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513134639] [2024-10-11 20:47:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:33,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:33,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:33,038 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:47:33,039 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:47:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:47:33,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:33,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513134639] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:33,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:47:33,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-10-11 20:47:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956746138] [2024-10-11 20:47:33,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:33,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:47:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:33,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:47:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:47:33,575 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 20:47:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:33,945 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2024-10-11 20:47:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:47:33,946 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 41 [2024-10-11 20:47:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:33,948 INFO L225 Difference]: With dead ends: 149 [2024-10-11 20:47:33,948 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 20:47:33,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:47:33,950 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 292 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:33,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 548 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:47:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 20:47:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 115. [2024-10-11 20:47:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 107 states have internal predecessors, (109), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2024-10-11 20:47:33,959 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 41 [2024-10-11 20:47:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:33,960 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2024-10-11 20:47:33,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 20:47:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2024-10-11 20:47:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:47:33,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:33,961 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:33,978 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:47:34,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:47:34,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:34,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1689653917, now seen corresponding path program 1 times [2024-10-11 20:47:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318782331] [2024-10-11 20:47:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:34,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:34,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812563440] [2024-10-11 20:47:34,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:34,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:34,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:34,182 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:47:34,183 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:47:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:34,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:47:34,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:34,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:34,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318782331] [2024-10-11 20:47:34,535 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812563440] [2024-10-11 20:47:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812563440] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:34,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:47:34,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 20:47:34,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681212234] [2024-10-11 20:47:34,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:34,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:47:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:34,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:47:34,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:47:34,539 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:47:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:34,872 INFO L93 Difference]: Finished difference Result 191 states and 215 transitions. [2024-10-11 20:47:34,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:47:34,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2024-10-11 20:47:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:34,874 INFO L225 Difference]: With dead ends: 191 [2024-10-11 20:47:34,874 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 20:47:34,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:47:34,874 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 159 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:34,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 314 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:47:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 20:47:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 158. [2024-10-11 20:47:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.4471544715447155) internal successors, (178), 149 states have internal predecessors, (178), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:47:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 190 transitions. [2024-10-11 20:47:34,883 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 190 transitions. Word has length 43 [2024-10-11 20:47:34,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:34,884 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 190 transitions. [2024-10-11 20:47:34,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:47:34,884 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 190 transitions. [2024-10-11 20:47:34,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:47:34,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:34,885 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:34,902 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:47:35,089 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,SelfDestructingSolverStorable10 [2024-10-11 20:47:35,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:35,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:35,090 INFO L85 PathProgramCache]: Analyzing trace with hash 259779167, now seen corresponding path program 1 times [2024-10-11 20:47:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:35,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576045077] [2024-10-11 20:47:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:35,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:35,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622877063] [2024-10-11 20:47:35,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:35,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:35,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:35,103 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:47:35,105 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:47:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:47:35,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:35,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:35,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:35,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576045077] [2024-10-11 20:47:35,171 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:35,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622877063] [2024-10-11 20:47:35,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622877063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:35,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:35,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:35,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354796112] [2024-10-11 20:47:35,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:35,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:35,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:35,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:35,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:35,172 INFO L87 Difference]: Start difference. First operand 158 states and 190 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:35,274 INFO L93 Difference]: Finished difference Result 272 states and 336 transitions. [2024-10-11 20:47:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2024-10-11 20:47:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:35,276 INFO L225 Difference]: With dead ends: 272 [2024-10-11 20:47:35,277 INFO L226 Difference]: Without dead ends: 243 [2024-10-11 20:47:35,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:35,278 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:35,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 131 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-11 20:47:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 235. [2024-10-11 20:47:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 198 states have (on average 1.393939393939394) internal successors, (276), 224 states have internal predecessors, (276), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 292 transitions. [2024-10-11 20:47:35,304 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 292 transitions. Word has length 45 [2024-10-11 20:47:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:35,305 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 292 transitions. [2024-10-11 20:47:35,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 292 transitions. [2024-10-11 20:47:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 20:47:35,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:35,307 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:35,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 20:47:35,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:35,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:35,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1625504061, now seen corresponding path program 1 times [2024-10-11 20:47:35,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:35,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262749026] [2024-10-11 20:47:35,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:35,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:35,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262749026] [2024-10-11 20:47:35,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262749026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:35,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:35,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:47:35,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206800631] [2024-10-11 20:47:35,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:35,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:35,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:35,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:35,595 INFO L87 Difference]: Start difference. First operand 235 states and 292 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:35,713 INFO L93 Difference]: Finished difference Result 235 states and 292 transitions. [2024-10-11 20:47:35,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:35,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-10-11 20:47:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:35,715 INFO L225 Difference]: With dead ends: 235 [2024-10-11 20:47:35,715 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 20:47:35,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:47:35,716 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 101 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:35,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 173 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 20:47:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-10-11 20:47:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 223 states have internal predecessors, (272), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 288 transitions. [2024-10-11 20:47:35,726 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 288 transitions. Word has length 63 [2024-10-11 20:47:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:35,727 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 288 transitions. [2024-10-11 20:47:35,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 288 transitions. [2024-10-11 20:47:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 20:47:35,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:35,728 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:35,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:47:35,728 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:35,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1625503741, now seen corresponding path program 1 times [2024-10-11 20:47:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:35,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195904936] [2024-10-11 20:47:35,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:35,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:35,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:35,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195904936] [2024-10-11 20:47:35,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195904936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:35,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:35,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:47:35,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53340107] [2024-10-11 20:47:35,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:35,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:47:35,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:35,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:47:35,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:35,793 INFO L87 Difference]: Start difference. First operand 234 states and 288 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:35,923 INFO L93 Difference]: Finished difference Result 242 states and 289 transitions. [2024-10-11 20:47:35,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:47:35,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-10-11 20:47:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:35,925 INFO L225 Difference]: With dead ends: 242 [2024-10-11 20:47:35,925 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 20:47:35,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:35,925 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 30 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:35,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 172 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 20:47:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 234. [2024-10-11 20:47:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 198 states have (on average 1.3636363636363635) internal successors, (270), 223 states have internal predecessors, (270), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 286 transitions. [2024-10-11 20:47:35,937 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 286 transitions. Word has length 63 [2024-10-11 20:47:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:35,937 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 286 transitions. [2024-10-11 20:47:35,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 286 transitions. [2024-10-11 20:47:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 20:47:35,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:35,938 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:35,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:47:35,938 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:35,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:35,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1148981528, now seen corresponding path program 1 times [2024-10-11 20:47:35,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:35,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420749511] [2024-10-11 20:47:35,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:35,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:35,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:35,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420749511] [2024-10-11 20:47:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420749511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:35,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:35,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:47:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804584558] [2024-10-11 20:47:35,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:35,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:47:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:35,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:47:35,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:35,998 INFO L87 Difference]: Start difference. First operand 234 states and 286 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:36,111 INFO L93 Difference]: Finished difference Result 245 states and 297 transitions. [2024-10-11 20:47:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:47:36,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-10-11 20:47:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:36,113 INFO L225 Difference]: With dead ends: 245 [2024-10-11 20:47:36,113 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 20:47:36,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:47:36,114 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 50 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:36,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 168 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:36,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 20:47:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 233. [2024-10-11 20:47:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 198 states have (on average 1.3434343434343434) internal successors, (266), 222 states have internal predecessors, (266), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 282 transitions. [2024-10-11 20:47:36,126 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 282 transitions. Word has length 64 [2024-10-11 20:47:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:36,126 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 282 transitions. [2024-10-11 20:47:36,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 282 transitions. [2024-10-11 20:47:36,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 20:47:36,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:36,127 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:36,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:47:36,128 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:36,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1148991458, now seen corresponding path program 1 times [2024-10-11 20:47:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159653179] [2024-10-11 20:47:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:36,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:36,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159653179] [2024-10-11 20:47:36,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159653179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:36,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:36,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:47:36,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813646604] [2024-10-11 20:47:36,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:36,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:36,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:36,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:36,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:36,231 INFO L87 Difference]: Start difference. First operand 233 states and 282 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:36,412 INFO L93 Difference]: Finished difference Result 236 states and 283 transitions. [2024-10-11 20:47:36,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:36,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-10-11 20:47:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:36,416 INFO L225 Difference]: With dead ends: 236 [2024-10-11 20:47:36,416 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 20:47:36,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:47:36,417 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 118 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:36,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 164 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:47:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 20:47:36,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2024-10-11 20:47:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 198 states have (on average 1.3333333333333333) internal successors, (264), 222 states have internal predecessors, (264), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2024-10-11 20:47:36,440 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 64 [2024-10-11 20:47:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:36,440 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2024-10-11 20:47:36,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2024-10-11 20:47:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 20:47:36,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:36,443 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:36,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:47:36,446 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:36,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1759618188, now seen corresponding path program 1 times [2024-10-11 20:47:36,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:36,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298957222] [2024-10-11 20:47:36,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:36,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:36,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:36,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298957222] [2024-10-11 20:47:36,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298957222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:36,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:36,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:47:36,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379299097] [2024-10-11 20:47:36,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:36,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:36,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:36,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:36,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:36,540 INFO L87 Difference]: Start difference. First operand 233 states and 280 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:36,658 INFO L93 Difference]: Finished difference Result 238 states and 287 transitions. [2024-10-11 20:47:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:36,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-10-11 20:47:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:36,660 INFO L225 Difference]: With dead ends: 238 [2024-10-11 20:47:36,660 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 20:47:36,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:47:36,661 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:36,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 221 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 20:47:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-11 20:47:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 200 states have (on average 1.315) internal successors, (263), 224 states have internal predecessors, (263), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2024-10-11 20:47:36,672 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 68 [2024-10-11 20:47:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:36,672 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2024-10-11 20:47:36,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2024-10-11 20:47:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 20:47:36,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:36,673 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:36,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:47:36,673 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:36,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1178681730, now seen corresponding path program 1 times [2024-10-11 20:47:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:36,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514851200] [2024-10-11 20:47:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:36,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514851200] [2024-10-11 20:47:36,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514851200] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:36,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930023543] [2024-10-11 20:47:36,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:36,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:36,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:36,781 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:47:36,783 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:47:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:47:36,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:36,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:37,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930023543] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:37,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:47:37,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-10-11 20:47:37,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581633902] [2024-10-11 20:47:37,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:37,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:47:37,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:37,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:47:37,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:47:37,125 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 14 states, 13 states have (on average 9.538461538461538) internal successors, (124), 14 states have internal predecessors, (124), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 20:47:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:37,631 INFO L93 Difference]: Finished difference Result 301 states and 367 transitions. [2024-10-11 20:47:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:47:37,632 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.538461538461538) internal successors, (124), 14 states have internal predecessors, (124), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 68 [2024-10-11 20:47:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:37,633 INFO L225 Difference]: With dead ends: 301 [2024-10-11 20:47:37,633 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 20:47:37,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2024-10-11 20:47:37,634 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 372 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:37,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 246 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:47:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 20:47:37,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 240. [2024-10-11 20:47:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 206 states have (on average 1.3058252427184467) internal successors, (269), 229 states have internal predecessors, (269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 285 transitions. [2024-10-11 20:47:37,648 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 285 transitions. Word has length 68 [2024-10-11 20:47:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:37,649 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 285 transitions. [2024-10-11 20:47:37,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.538461538461538) internal successors, (124), 14 states have internal predecessors, (124), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 20:47:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 285 transitions. [2024-10-11 20:47:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 20:47:37,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:37,650 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:37,666 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:47:37,850 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,SelfDestructingSolverStorable17 [2024-10-11 20:47:37,851 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:37,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1286410942, now seen corresponding path program 1 times [2024-10-11 20:47:37,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:37,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950526838] [2024-10-11 20:47:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:37,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:37,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:37,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:37,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:37,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950526838] [2024-10-11 20:47:37,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950526838] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:37,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003864894] [2024-10-11 20:47:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:37,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:37,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:37,931 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:47:37,932 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:47:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:37,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:47:37,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:38,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:38,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003864894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:38,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:47:38,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-11 20:47:38,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814175559] [2024-10-11 20:47:38,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:38,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:47:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:47:38,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:47:38,307 INFO L87 Difference]: Start difference. First operand 240 states and 285 transitions. Second operand has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 20:47:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:38,744 INFO L93 Difference]: Finished difference Result 274 states and 325 transitions. [2024-10-11 20:47:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:47:38,745 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 69 [2024-10-11 20:47:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:38,747 INFO L225 Difference]: With dead ends: 274 [2024-10-11 20:47:38,747 INFO L226 Difference]: Without dead ends: 272 [2024-10-11 20:47:38,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:47:38,748 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 191 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:38,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 260 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:47:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-11 20:47:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 245. [2024-10-11 20:47:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 211 states have (on average 1.2748815165876777) internal successors, (269), 234 states have internal predecessors, (269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 285 transitions. [2024-10-11 20:47:38,762 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 285 transitions. Word has length 69 [2024-10-11 20:47:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:38,762 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 285 transitions. [2024-10-11 20:47:38,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 20:47:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 285 transitions. [2024-10-11 20:47:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 20:47:38,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:38,763 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:38,779 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:47:38,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:38,968 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:38,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2115571956, now seen corresponding path program 1 times [2024-10-11 20:47:38,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:38,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373998627] [2024-10-11 20:47:38,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:39,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:39,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:39,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:39,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:39,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:39,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:39,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373998627] [2024-10-11 20:47:39,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373998627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:39,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855256964] [2024-10-11 20:47:39,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:39,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:39,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:39,055 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:47:39,057 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:47:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:39,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:47:39,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:54,694 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_52| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_52| |v_ULTIMATE.start_main_~R~0#1_52|))) (and (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0) (<= .cse0 9223372036854775807)))) is different from true [2024-10-11 20:47:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 3 not checked. [2024-10-11 20:47:54,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:54,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855256964] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:54,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:47:54,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-11 20:47:54,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467819496] [2024-10-11 20:47:54,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:54,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:47:54,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:47:54,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=106, Unknown=6, NotChecked=22, Total=182 [2024-10-11 20:47:54,860 INFO L87 Difference]: Start difference. First operand 245 states and 285 transitions. Second operand has 14 states, 13 states have (on average 8.923076923076923) internal successors, (116), 14 states have internal predecessors, (116), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 20:48:09,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:10,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:15,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:19,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:20,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:21,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:25,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:29,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:33,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:38,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:42,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:47,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:50,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:54,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:56,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:57,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:58,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:49:01,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:49:05,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:49:05,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:49:05,239 INFO L93 Difference]: Finished difference Result 285 states and 332 transitions. [2024-10-11 20:49:05,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:49:05,239 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.923076923076923) internal successors, (116), 14 states have internal predecessors, (116), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 69 [2024-10-11 20:49:05,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:49:05,241 INFO L225 Difference]: With dead ends: 285 [2024-10-11 20:49:05,241 INFO L226 Difference]: Without dead ends: 280 [2024-10-11 20:49:05,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=132, Invalid=283, Unknown=9, NotChecked=38, Total=462 [2024-10-11 20:49:05,242 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 229 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 31 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 60.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:49:05,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 264 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 461 Invalid, 22 Unknown, 195 Unchecked, 60.2s Time] [2024-10-11 20:49:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-11 20:49:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 267. [2024-10-11 20:49:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 236 states have (on average 1.2542372881355932) internal successors, (296), 255 states have internal predecessors, (296), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:49:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 314 transitions. [2024-10-11 20:49:05,260 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 314 transitions. Word has length 69 [2024-10-11 20:49:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:49:05,260 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 314 transitions. [2024-10-11 20:49:05,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.923076923076923) internal successors, (116), 14 states have internal predecessors, (116), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 20:49:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 314 transitions. [2024-10-11 20:49:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 20:49:05,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:05,261 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:49:05,278 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:49:05,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:49:05,462 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:49:05,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1224033458, now seen corresponding path program 1 times [2024-10-11 20:49:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:49:05,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303636912] [2024-10-11 20:49:05,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:49:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:05,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:49:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:05,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:49:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:05,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:49:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:05,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:49:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:05,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:49:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:49:05,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:49:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303636912] [2024-10-11 20:49:05,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303636912] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:49:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349296514] [2024-10-11 20:49:05,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:05,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:49:05,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:49:05,587 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:49:05,588 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:49:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:05,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:49:05,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:49:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:49:05,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:49:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:49:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349296514] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:49:05,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:49:05,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-11 20:49:05,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104759802] [2024-10-11 20:49:05,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:49:05,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:49:05,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:49:05,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:49:05,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:49:05,939 INFO L87 Difference]: Start difference. First operand 267 states and 314 transitions. Second operand has 14 states, 13 states have (on average 9.23076923076923) internal successors, (120), 14 states have internal predecessors, (120), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-11 20:49:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:49:06,373 INFO L93 Difference]: Finished difference Result 296 states and 347 transitions. [2024-10-11 20:49:06,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:49:06,374 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.23076923076923) internal successors, (120), 14 states have internal predecessors, (120), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 70 [2024-10-11 20:49:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:49:06,376 INFO L225 Difference]: With dead ends: 296 [2024-10-11 20:49:06,376 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 20:49:06,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:49:06,376 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 87 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:49:06,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 280 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:49:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 20:49:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 267. [2024-10-11 20:49:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 255 states have internal predecessors, (292), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:49:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 310 transitions. [2024-10-11 20:49:06,391 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 310 transitions. Word has length 70 [2024-10-11 20:49:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:49:06,391 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 310 transitions. [2024-10-11 20:49:06,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.23076923076923) internal successors, (120), 14 states have internal predecessors, (120), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-11 20:49:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 310 transitions. [2024-10-11 20:49:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 20:49:06,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:06,393 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:49:06,410 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:49:06,597 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,SelfDestructingSolverStorable20 [2024-10-11 20:49:06,598 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:49:06,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash -156161006, now seen corresponding path program 1 times [2024-10-11 20:49:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:49:06,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343579004] [2024-10-11 20:49:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:49:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:49:06,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057510335] [2024-10-11 20:49:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:06,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:49:06,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:49:06,619 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:49:06,620 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:49:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:06,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:49:06,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:49:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:49:06,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:49:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:49:06,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:49:06,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343579004] [2024-10-11 20:49:06,819 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:49:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057510335] [2024-10-11 20:49:06,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057510335] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:49:06,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:49:06,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-11 20:49:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906086250] [2024-10-11 20:49:06,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:49:06,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:49:06,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:49:06,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:49:06,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:49:06,822 INFO L87 Difference]: Start difference. First operand 267 states and 310 transitions. Second operand has 6 states, 5 states have (on average 19.0) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:49:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:49:07,082 INFO L93 Difference]: Finished difference Result 550 states and 690 transitions. [2024-10-11 20:49:07,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:49:07,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.0) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2024-10-11 20:49:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:49:07,112 INFO L225 Difference]: With dead ends: 550 [2024-10-11 20:49:07,112 INFO L226 Difference]: Without dead ends: 524 [2024-10-11 20:49:07,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:49:07,113 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 208 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:49:07,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 253 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:49:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-11 20:49:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 469. [2024-10-11 20:49:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 440 states have (on average 1.1818181818181819) internal successors, (520), 451 states have internal predecessors, (520), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 20:49:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 550 transitions. [2024-10-11 20:49:07,140 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 550 transitions. Word has length 75 [2024-10-11 20:49:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:49:07,140 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 550 transitions. [2024-10-11 20:49:07,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.0) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:49:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 550 transitions. [2024-10-11 20:49:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 20:49:07,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:07,141 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:49:07,157 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:49:07,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:49:07,342 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:49:07,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:07,342 INFO L85 PathProgramCache]: Analyzing trace with hash 329928270, now seen corresponding path program 1 times [2024-10-11 20:49:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:49:07,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626208692] [2024-10-11 20:49:07,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:49:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:49:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:07,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:49:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:07,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:49:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:07,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:49:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:07,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:49:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:49:07,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:49:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626208692] [2024-10-11 20:49:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626208692] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:49:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613920525] [2024-10-11 20:49:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:07,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:49:07,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:49:07,480 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:49:07,481 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:49:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:07,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:49:07,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:49:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:49:07,646 INFO L311 TraceCheckSpWp]: Computing backward predicates...