./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_15_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5a3f4caaf6a4997d60a48fcffee94d3f6236ef7a010d20bcbf30cd0ad60759da --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:05:25,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:05:25,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 16:05:25,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:05:25,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:05:25,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:05:25,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:05:25,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:05:25,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:05:25,770 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:05:25,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 16:05:25,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 16:05:25,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:05:25,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:05:25,772 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:05:25,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:05:25,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 16:05:25,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:05:25,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:05:25,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 16:05:25,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 16:05:25,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 16:05:25,776 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:05:25,776 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 16:05:25,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:05:25,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:05:25,777 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:05:25,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:05:25,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:05:25,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 16:05:25,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 16:05:25,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:05:25,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:05:25,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 16:05:25,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 16:05:25,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:05:25,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 16:05:25,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 16:05:25,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 16:05:25,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 16:05:25,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 16:05:25,782 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a3f4caaf6a4997d60a48fcffee94d3f6236ef7a010d20bcbf30cd0ad60759da [2024-10-13 16:05:26,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:05:26,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:05:26,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:05:26,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:05:26,049 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:05:26,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_15_good.i [2024-10-13 16:05:27,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:05:27,836 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:05:27,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_15_good.i [2024-10-13 16:05:27,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98bb1441/c8be5bcd9ce441459a91abe08fbb55ec/FLAG131d49dc0 [2024-10-13 16:05:27,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98bb1441/c8be5bcd9ce441459a91abe08fbb55ec [2024-10-13 16:05:27,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:05:27,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:05:27,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:05:27,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:05:27,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:05:27,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:05:27" (1/1) ... [2024-10-13 16:05:27,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d76168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:27, skipping insertion in model container [2024-10-13 16:05:27,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:05:27" (1/1) ... [2024-10-13 16:05:27,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:05:28,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:05:28,764 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:05:28,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:05:28,952 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:05:28,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28 WrapperNode [2024-10-13 16:05:28,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:05:28,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:05:28,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:05:28,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:05:28,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:28,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:29,042 INFO L138 Inliner]: procedures = 501, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 337 [2024-10-13 16:05:29,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:05:29,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:05:29,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:05:29,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:05:29,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:29,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:29,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:29,089 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:05:29,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:29,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:29,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:29,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:29,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:29,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:29,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:05:29,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:05:29,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:05:29,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:05:29,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:29,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:05:29,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:05:29,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 16:05:29,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 16:05:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 16:05:29,207 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 16:05:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 16:05:29,207 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 16:05:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 16:05:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:05:29,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:05:29,385 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:05:29,387 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:05:29,794 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-13 16:05:29,794 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:05:29,819 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:05:29,819 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 16:05:29,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:29 BoogieIcfgContainer [2024-10-13 16:05:29,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:05:29,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 16:05:29,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 16:05:29,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 16:05:29,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:05:27" (1/3) ... [2024-10-13 16:05:29,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d17122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:05:29, skipping insertion in model container [2024-10-13 16:05:29,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28" (2/3) ... [2024-10-13 16:05:29,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d17122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:05:29, skipping insertion in model container [2024-10-13 16:05:29,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:29" (3/3) ... [2024-10-13 16:05:29,827 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_15_good.i [2024-10-13 16:05:29,839 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 16:05:29,839 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 16:05:29,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 16:05:29,905 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;@16151f4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 16:05:29,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 16:05:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 91 states have (on average 1.5824175824175823) internal successors, (144), 107 states have internal predecessors, (144), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 16:05:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 16:05:29,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:29,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:29,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:29,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash -776277988, now seen corresponding path program 1 times [2024-10-13 16:05:29,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:29,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995167811] [2024-10-13 16:05:29,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:29,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:30,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:30,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995167811] [2024-10-13 16:05:30,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995167811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:30,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:30,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:30,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943347326] [2024-10-13 16:05:30,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:30,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:30,231 INFO L87 Difference]: Start difference. First operand has 118 states, 91 states have (on average 1.5824175824175823) internal successors, (144), 107 states have internal predecessors, (144), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:30,291 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2024-10-13 16:05:30,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:30,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-13 16:05:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:30,305 INFO L225 Difference]: With dead ends: 208 [2024-10-13 16:05:30,305 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 16:05:30,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 16:05:30,314 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:30,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:30,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 16:05:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-13 16:05:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.558139534883721) internal successors, (134), 99 states have internal predecessors, (134), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 16:05:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 158 transitions. [2024-10-13 16:05:30,358 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 158 transitions. Word has length 14 [2024-10-13 16:05:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:30,359 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 158 transitions. [2024-10-13 16:05:30,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 158 transitions. [2024-10-13 16:05:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 16:05:30,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:30,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:30,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 16:05:30,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:30,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1686331749, now seen corresponding path program 1 times [2024-10-13 16:05:30,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:30,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684698498] [2024-10-13 16:05:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:30,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:30,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684698498] [2024-10-13 16:05:30,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684698498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:30,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:30,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:05:30,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462604145] [2024-10-13 16:05:30,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:30,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:30,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:30,482 INFO L87 Difference]: Start difference. First operand 108 states and 158 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:30,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:30,524 INFO L93 Difference]: Finished difference Result 108 states and 158 transitions. [2024-10-13 16:05:30,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:30,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-13 16:05:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:30,527 INFO L225 Difference]: With dead ends: 108 [2024-10-13 16:05:30,529 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 16:05:30,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-13 16:05:30,531 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:30,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 259 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 16:05:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-13 16:05:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.5465116279069768) internal successors, (133), 98 states have internal predecessors, (133), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 16:05:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2024-10-13 16:05:30,543 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 19 [2024-10-13 16:05:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:30,544 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2024-10-13 16:05:30,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2024-10-13 16:05:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 16:05:30,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:30,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:30,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 16:05:30,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:30,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash -736676515, now seen corresponding path program 1 times [2024-10-13 16:05:30,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:30,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745728731] [2024-10-13 16:05:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:30,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745728731] [2024-10-13 16:05:30,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745728731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:30,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:30,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:05:30,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023502331] [2024-10-13 16:05:30,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:30,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:30,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:30,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:30,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:30,737 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:30,773 INFO L93 Difference]: Finished difference Result 108 states and 158 transitions. [2024-10-13 16:05:30,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:30,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-13 16:05:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:30,778 INFO L225 Difference]: With dead ends: 108 [2024-10-13 16:05:30,778 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 16:05:30,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-13 16:05:30,780 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 37 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:30,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 251 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 16:05:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-10-13 16:05:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.5348837209302326) internal successors, (132), 97 states have internal predecessors, (132), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 16:05:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2024-10-13 16:05:30,804 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 20 [2024-10-13 16:05:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:30,804 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2024-10-13 16:05:30,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2024-10-13 16:05:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 16:05:30,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:30,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:30,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 16:05:30,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:30,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash 542924658, now seen corresponding path program 1 times [2024-10-13 16:05:30,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:30,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479945424] [2024-10-13 16:05:30,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:30,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:30,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:30,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479945424] [2024-10-13 16:05:30,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479945424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:30,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:30,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:30,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864690537] [2024-10-13 16:05:30,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:30,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:30,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:30,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:30,872 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:30,906 INFO L93 Difference]: Finished difference Result 175 states and 255 transitions. [2024-10-13 16:05:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:30,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-13 16:05:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:30,909 INFO L225 Difference]: With dead ends: 175 [2024-10-13 16:05:30,909 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 16:05:30,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 16:05:30,910 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:30,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 16:05:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-13 16:05:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 97 states have internal predecessors, (131), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 16:05:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-10-13 16:05:30,926 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 24 [2024-10-13 16:05:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:30,927 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-10-13 16:05:30,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-10-13 16:05:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 16:05:30,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:30,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:30,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 16:05:30,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash 385682421, now seen corresponding path program 1 times [2024-10-13 16:05:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507063805] [2024-10-13 16:05:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 16:05:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,995 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-13 16:05:30,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507063805] [2024-10-13 16:05:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507063805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:30,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:30,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981492151] [2024-10-13 16:05:30,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:30,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:30,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:30,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:30,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,000 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-13 16:05:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:31,022 INFO L93 Difference]: Finished difference Result 175 states and 254 transitions. [2024-10-13 16:05:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:31,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 28 [2024-10-13 16:05:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:31,027 INFO L225 Difference]: With dead ends: 175 [2024-10-13 16:05:31,027 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 16:05:31,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,029 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:31,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 16:05:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 16:05:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.5116279069767442) internal successors, (130), 96 states have internal predecessors, (130), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 16:05:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2024-10-13 16:05:31,041 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 28 [2024-10-13 16:05:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:31,041 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2024-10-13 16:05:31,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-13 16:05:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2024-10-13 16:05:31,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 16:05:31,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:31,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:31,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 16:05:31,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:31,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1353301445, now seen corresponding path program 1 times [2024-10-13 16:05:31,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:31,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052692987] [2024-10-13 16:05:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:31,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:31,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052692987] [2024-10-13 16:05:31,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052692987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:31,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:31,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859929003] [2024-10-13 16:05:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:31,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:31,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:31,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,101 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:05:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:31,117 INFO L93 Difference]: Finished difference Result 148 states and 209 transitions. [2024-10-13 16:05:31,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:31,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-13 16:05:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:31,119 INFO L225 Difference]: With dead ends: 148 [2024-10-13 16:05:31,119 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 16:05:31,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,121 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:31,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 16:05:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-13 16:05:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 94 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 16:05:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 147 transitions. [2024-10-13 16:05:31,129 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 147 transitions. Word has length 31 [2024-10-13 16:05:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:31,129 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 147 transitions. [2024-10-13 16:05:31,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:05:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 147 transitions. [2024-10-13 16:05:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 16:05:31,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:31,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:31,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 16:05:31,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:31,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash 529964549, now seen corresponding path program 1 times [2024-10-13 16:05:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:31,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194580689] [2024-10-13 16:05:31,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:31,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:31,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194580689] [2024-10-13 16:05:31,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194580689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:31,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:31,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:05:31,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584198958] [2024-10-13 16:05:31,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:31,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:31,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:31,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,189 INFO L87 Difference]: Start difference. First operand 103 states and 147 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:05:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:31,238 INFO L93 Difference]: Finished difference Result 103 states and 147 transitions. [2024-10-13 16:05:31,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:31,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-10-13 16:05:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:31,240 INFO L225 Difference]: With dead ends: 103 [2024-10-13 16:05:31,240 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 16:05:31,240 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-13 16:05:31,241 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 36 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:31,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 238 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 16:05:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-13 16:05:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 93 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 16:05:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2024-10-13 16:05:31,256 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 36 [2024-10-13 16:05:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:31,256 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2024-10-13 16:05:31,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:05:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2024-10-13 16:05:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 16:05:31,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:31,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:31,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 16:05:31,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:31,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:31,261 INFO L85 PathProgramCache]: Analyzing trace with hash -750967898, now seen corresponding path program 1 times [2024-10-13 16:05:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:31,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311744330] [2024-10-13 16:05:31,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:31,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:31,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:31,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311744330] [2024-10-13 16:05:31,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311744330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:31,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:31,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:05:31,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994009022] [2024-10-13 16:05:31,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:31,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:31,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:31,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:31,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,391 INFO L87 Difference]: Start difference. First operand 102 states and 146 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:05:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:31,415 INFO L93 Difference]: Finished difference Result 103 states and 147 transitions. [2024-10-13 16:05:31,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:31,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-10-13 16:05:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:31,417 INFO L225 Difference]: With dead ends: 103 [2024-10-13 16:05:31,418 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 16:05:31,419 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-13 16:05:31,420 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 38 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:31,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 230 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 16:05:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-10-13 16:05:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 92 states have internal predecessors, (125), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 16:05:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 145 transitions. [2024-10-13 16:05:31,434 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 145 transitions. Word has length 37 [2024-10-13 16:05:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:31,435 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 145 transitions. [2024-10-13 16:05:31,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:05:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 145 transitions. [2024-10-13 16:05:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 16:05:31,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:31,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:31,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 16:05:31,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:31,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:31,437 INFO L85 PathProgramCache]: Analyzing trace with hash 829076388, now seen corresponding path program 1 times [2024-10-13 16:05:31,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:31,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050931273] [2024-10-13 16:05:31,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:31,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:31,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:31,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050931273] [2024-10-13 16:05:31,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050931273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:31,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:31,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690071217] [2024-10-13 16:05:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:31,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:31,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:31,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,501 INFO L87 Difference]: Start difference. First operand 101 states and 145 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:05:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:31,525 INFO L93 Difference]: Finished difference Result 131 states and 183 transitions. [2024-10-13 16:05:31,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:31,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-10-13 16:05:31,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:31,528 INFO L225 Difference]: With dead ends: 131 [2024-10-13 16:05:31,528 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 16:05:31,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,529 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:31,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 16:05:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 16:05:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 90 states have internal predecessors, (122), 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-13 16:05:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2024-10-13 16:05:31,545 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 41 [2024-10-13 16:05:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:31,549 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2024-10-13 16:05:31,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:05:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2024-10-13 16:05:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 16:05:31,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:31,551 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:31,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 16:05:31,551 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:31,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1940650987, now seen corresponding path program 1 times [2024-10-13 16:05:31,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:31,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041582000] [2024-10-13 16:05:31,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:31,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 16:05:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,616 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-13 16:05:31,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:31,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041582000] [2024-10-13 16:05:31,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041582000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:31,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:31,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:05:31,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900111316] [2024-10-13 16:05:31,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:31,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:31,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:31,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:31,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,620 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:05:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:31,639 INFO L93 Difference]: Finished difference Result 100 states and 141 transitions. [2024-10-13 16:05:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-10-13 16:05:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:31,641 INFO L225 Difference]: With dead ends: 100 [2024-10-13 16:05:31,641 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 16:05:31,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-13 16:05:31,643 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 7 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:31,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 251 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 16:05:31,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-13 16:05:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 89 states have internal predecessors, (121), 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-13 16:05:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2024-10-13 16:05:31,653 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 47 [2024-10-13 16:05:31,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:31,653 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2024-10-13 16:05:31,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:05:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2024-10-13 16:05:31,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 16:05:31,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:31,656 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:31,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 16:05:31,657 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:31,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:31,657 INFO L85 PathProgramCache]: Analyzing trace with hash 30638759, now seen corresponding path program 1 times [2024-10-13 16:05:31,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:31,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211531750] [2024-10-13 16:05:31,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:31,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 16:05:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,722 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-13 16:05:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:31,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211531750] [2024-10-13 16:05:31,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211531750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:31,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:31,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:05:31,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187956672] [2024-10-13 16:05:31,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:31,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:31,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:31,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,725 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:05:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:31,748 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2024-10-13 16:05:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:31,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-10-13 16:05:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:31,750 INFO L225 Difference]: With dead ends: 106 [2024-10-13 16:05:31,750 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 16:05:31,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-13 16:05:31,751 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:31,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 263 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 16:05:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2024-10-13 16:05:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 93 states have internal predecessors, (126), 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-13 16:05:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-10-13 16:05:31,762 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 48 [2024-10-13 16:05:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:31,763 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-10-13 16:05:31,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:05:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-10-13 16:05:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 16:05:31,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:31,764 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:31,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 16:05:31,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:31,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:31,765 INFO L85 PathProgramCache]: Analyzing trace with hash 32485801, now seen corresponding path program 1 times [2024-10-13 16:05:31,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899847614] [2024-10-13 16:05:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 16:05:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,825 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-13 16:05:31,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899847614] [2024-10-13 16:05:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899847614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:31,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:31,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:31,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221880463] [2024-10-13 16:05:31,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:31,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:31,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:31,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:31,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,828 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:05:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:31,846 INFO L93 Difference]: Finished difference Result 127 states and 174 transitions. [2024-10-13 16:05:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:31,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-10-13 16:05:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:31,848 INFO L225 Difference]: With dead ends: 127 [2024-10-13 16:05:31,848 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 16:05:31,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-13 16:05:31,849 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:31,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 16:05:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-13 16:05:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 92 states have internal predecessors, (125), 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-13 16:05:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-10-13 16:05:31,856 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 48 [2024-10-13 16:05:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:31,856 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-10-13 16:05:31,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:05:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-10-13 16:05:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 16:05:31,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:31,859 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:05:31,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 16:05:31,860 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:31,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:31,860 INFO L85 PathProgramCache]: Analyzing trace with hash -287872742, now seen corresponding path program 1 times [2024-10-13 16:05:31,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:31,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22303034] [2024-10-13 16:05:31,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:31,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 16:05:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:05:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 16:05:31,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:31,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22303034] [2024-10-13 16:05:31,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22303034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:31,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:31,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:31,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866728260] [2024-10-13 16:05:31,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:31,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:31,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:31,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:31,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:31,945 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 16:05:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:31,964 INFO L93 Difference]: Finished difference Result 122 states and 167 transitions. [2024-10-13 16:05:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:31,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-10-13 16:05:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:31,965 INFO L225 Difference]: With dead ends: 122 [2024-10-13 16:05:31,965 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 16:05:31,965 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-13 16:05:31,966 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:31,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 16:05:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 16:05:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 87 states have internal predecessors, (118), 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-13 16:05:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-10-13 16:05:31,972 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 52 [2024-10-13 16:05:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:31,973 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-10-13 16:05:31,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 16:05:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-10-13 16:05:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 16:05:31,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:31,975 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:31,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 16:05:31,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:31,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:31,976 INFO L85 PathProgramCache]: Analyzing trace with hash -760480791, now seen corresponding path program 1 times [2024-10-13 16:05:31,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:31,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054977423] [2024-10-13 16:05:31,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:31,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 16:05:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,030 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-13 16:05:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:32,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054977423] [2024-10-13 16:05:32,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054977423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:32,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:32,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092670931] [2024-10-13 16:05:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:32,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:32,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:32,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:32,034 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:05:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:32,050 INFO L93 Difference]: Finished difference Result 110 states and 150 transitions. [2024-10-13 16:05:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:32,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-10-13 16:05:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:32,052 INFO L225 Difference]: With dead ends: 110 [2024-10-13 16:05:32,052 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 16:05:32,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-13 16:05:32,053 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:32,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:32,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 16:05:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 16:05:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 85 states have internal predecessors, (115), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 16:05:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2024-10-13 16:05:32,059 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 52 [2024-10-13 16:05:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:32,059 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2024-10-13 16:05:32,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:05:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2024-10-13 16:05:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 16:05:32,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:32,060 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:32,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 16:05:32,060 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:32,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1778367728, now seen corresponding path program 1 times [2024-10-13 16:05:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:32,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748720554] [2024-10-13 16:05:32,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:32,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 16:05:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 16:05:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 16:05:32,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:32,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748720554] [2024-10-13 16:05:32,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748720554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:32,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:32,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:05:32,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538640347] [2024-10-13 16:05:32,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:32,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:32,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:32,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:32,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:32,140 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-13 16:05:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:32,155 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2024-10-13 16:05:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:32,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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 57 [2024-10-13 16:05:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:32,157 INFO L225 Difference]: With dead ends: 94 [2024-10-13 16:05:32,157 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 16:05:32,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-13 16:05:32,158 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:32,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 235 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 16:05:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 16:05:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 84 states have internal predecessors, (114), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 16:05:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2024-10-13 16:05:32,163 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 57 [2024-10-13 16:05:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:32,164 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2024-10-13 16:05:32,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-13 16:05:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2024-10-13 16:05:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 16:05:32,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:32,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:32,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 16:05:32,165 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:32,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash -705174940, now seen corresponding path program 1 times [2024-10-13 16:05:32,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:32,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579606118] [2024-10-13 16:05:32,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:32,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 16:05:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 16:05:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 16:05:32,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:32,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579606118] [2024-10-13 16:05:32,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579606118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:32,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:32,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:05:32,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159535164] [2024-10-13 16:05:32,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:32,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:32,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:32,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:32,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:32,263 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-13 16:05:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:32,285 INFO L93 Difference]: Finished difference Result 98 states and 132 transitions. [2024-10-13 16:05:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:32,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 58 [2024-10-13 16:05:32,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:32,286 INFO L225 Difference]: With dead ends: 98 [2024-10-13 16:05:32,290 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 16:05:32,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-13 16:05:32,291 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:32,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 16:05:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 16:05:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 84 states have internal predecessors, (113), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 16:05:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2024-10-13 16:05:32,299 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 58 [2024-10-13 16:05:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:32,299 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2024-10-13 16:05:32,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-13 16:05:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2024-10-13 16:05:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 16:05:32,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:32,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:32,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 16:05:32,301 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:05:32,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:32,301 INFO L85 PathProgramCache]: Analyzing trace with hash -330266417, now seen corresponding path program 1 times [2024-10-13 16:05:32,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:32,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627973457] [2024-10-13 16:05:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:32,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:05:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 16:05:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 16:05:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 16:05:32,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:32,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627973457] [2024-10-13 16:05:32,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627973457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:32,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:32,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:32,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345923013] [2024-10-13 16:05:32,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:32,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:32,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:32,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:32,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:32,369 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-13 16:05:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:32,382 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2024-10-13 16:05:32,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:32,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 59 [2024-10-13 16:05:32,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:32,384 INFO L225 Difference]: With dead ends: 97 [2024-10-13 16:05:32,385 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 16:05:32,385 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-13 16:05:32,385 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:32,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:32,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 16:05:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 16:05:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:05:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 16:05:32,386 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2024-10-13 16:05:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:32,387 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 16:05:32,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-13 16:05:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 16:05:32,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 16:05:32,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 16:05:32,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 16:05:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 16:05:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 16:05:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 16:05:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 16:05:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 16:05:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 16:05:32,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 16:05:32,397 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:32,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 16:05:32,432 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 16:05:32,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:05:32 BoogieIcfgContainer [2024-10-13 16:05:32,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 16:05:32,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:05:32,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:05:32,450 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:05:32,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:29" (3/4) ... [2024-10-13 16:05:32,452 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 16:05:32,455 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 16:05:32,456 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 16:05:32,468 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-13 16:05:32,469 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-13 16:05:32,470 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 16:05:32,470 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 16:05:32,470 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 16:05:32,591 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 16:05:32,592 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 16:05:32,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 16:05:32,592 INFO L158 Benchmark]: Toolchain (without parser) took 4713.29ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 78.8MB in the beginning and 58.4MB in the end (delta: 20.4MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2024-10-13 16:05:32,593 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory was 108.3MB in the beginning and 108.2MB in the end (delta: 141.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:05:32,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1072.70ms. Allocated memory is still 153.1MB. Free memory was 78.6MB in the beginning and 75.4MB in the end (delta: 3.2MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-10-13 16:05:32,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.02ms. Allocated memory is still 153.1MB. Free memory was 75.4MB in the beginning and 71.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 16:05:32,594 INFO L158 Benchmark]: Boogie Preprocessor took 75.35ms. Allocated memory is still 153.1MB. Free memory was 71.7MB in the beginning and 68.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:05:32,594 INFO L158 Benchmark]: RCFGBuilder took 698.79ms. Allocated memory is still 153.1MB. Free memory was 68.6MB in the beginning and 106.3MB in the end (delta: -37.6MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-10-13 16:05:32,594 INFO L158 Benchmark]: TraceAbstraction took 2627.32ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 105.4MB in the beginning and 66.8MB in the end (delta: 38.7MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2024-10-13 16:05:32,595 INFO L158 Benchmark]: Witness Printer took 142.71ms. Allocated memory is still 201.3MB. Free memory was 66.8MB in the beginning and 58.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 16:05:32,596 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory was 108.3MB in the beginning and 108.2MB in the end (delta: 141.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1072.70ms. Allocated memory is still 153.1MB. Free memory was 78.6MB in the beginning and 75.4MB in the end (delta: 3.2MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.02ms. Allocated memory is still 153.1MB. Free memory was 75.4MB in the beginning and 71.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.35ms. Allocated memory is still 153.1MB. Free memory was 71.7MB in the beginning and 68.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 698.79ms. Allocated memory is still 153.1MB. Free memory was 68.6MB in the beginning and 106.3MB in the end (delta: -37.6MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2627.32ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 105.4MB in the beginning and 66.8MB in the end (delta: 38.7MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. * Witness Printer took 142.71ms. Allocated memory is still 201.3MB. Free memory was 66.8MB in the beginning and 58.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 118 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 4410 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2104 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 236 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 2306 mSDtfsCounter, 236 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 671 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 654 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 50/50 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 16:05:32,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE