./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/CWE190_Integer_Overflow__int_fscanf_add_05_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/CWE190_Integer_Overflow__int_fscanf_add_05_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 c59dfa9c0cf634e66cd369aa812f8de7f78385cdbe2af8179a398970700f739c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 14:53:40,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 14:53:40,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 14:53:40,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 14:53:40,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 14:53:40,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 14:53:40,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 14:53:40,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 14:53:40,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 14:53:40,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 14:53:40,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 14:53:40,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 14:53:40,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 14:53:40,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 14:53:40,582 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 14:53:40,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 14:53:40,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 14:53:40,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 14:53:40,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 14:53:40,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 14:53:40,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 14:53:40,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 14:53:40,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 14:53:40,587 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 14:53:40,587 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 14:53:40,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 14:53:40,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 14:53:40,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 14:53:40,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 14:53:40,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 14:53:40,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 14:53:40,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:53:40,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 14:53:40,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 14:53:40,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 14:53:40,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 14:53:40,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 14:53:40,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 14:53:40,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 14:53:40,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 14:53:40,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 14:53:40,593 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 -> c59dfa9c0cf634e66cd369aa812f8de7f78385cdbe2af8179a398970700f739c [2024-10-13 14:53:40,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 14:53:40,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 14:53:40,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 14:53:40,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 14:53:40,878 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 14:53:40,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_05_good.i [2024-10-13 14:53:42,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 14:53:42,654 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 14:53:42,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_05_good.i [2024-10-13 14:53:42,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b322dd88/98d36a8498a9474ca39e8b6ecce0ad40/FLAG502b90783 [2024-10-13 14:53:42,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b322dd88/98d36a8498a9474ca39e8b6ecce0ad40 [2024-10-13 14:53:42,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 14:53:42,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 14:53:42,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 14:53:42,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 14:53:42,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 14:53:42,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:53:42" (1/1) ... [2024-10-13 14:53:42,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2830923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:42, skipping insertion in model container [2024-10-13 14:53:42,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:53:42" (1/1) ... [2024-10-13 14:53:42,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 14:53:43,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:53:43,725 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 14:53:43,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:53:43,921 INFO L204 MainTranslator]: Completed translation [2024-10-13 14:53:43,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43 WrapperNode [2024-10-13 14:53:43,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 14:53:43,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 14:53:43,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 14:53:43,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 14:53:43,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:43,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:43,979 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 99 [2024-10-13 14:53:43,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 14:53:43,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 14:53:43,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 14:53:43,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 14:53:43,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:43,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:43,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:44,009 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 14:53:44,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:44,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:44,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:44,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:44,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:44,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:44,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 14:53:44,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 14:53:44,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 14:53:44,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 14:53:44,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (1/1) ... [2024-10-13 14:53:44,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:53:44,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 14:53:44,068 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 14:53:44,070 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 14:53:44,108 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 14:53:44,109 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 14:53:44,109 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 14:53:44,109 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 14:53:44,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 14:53:44,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 14:53:44,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 14:53:44,252 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 14:53:44,254 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 14:53:44,407 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-13 14:53:44,408 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 14:53:44,435 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 14:53:44,435 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 14:53:44,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:53:44 BoogieIcfgContainer [2024-10-13 14:53:44,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 14:53:44,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 14:53:44,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 14:53:44,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 14:53:44,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:53:42" (1/3) ... [2024-10-13 14:53:44,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c6730b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:53:44, skipping insertion in model container [2024-10-13 14:53:44,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:43" (2/3) ... [2024-10-13 14:53:44,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c6730b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:53:44, skipping insertion in model container [2024-10-13 14:53:44,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:53:44" (3/3) ... [2024-10-13 14:53:44,443 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_add_05_good.i [2024-10-13 14:53:44,455 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 14:53:44,455 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 14:53:44,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 14:53:44,513 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;@531289d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 14:53:44,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 14:53:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 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 14:53:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 14:53:44,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:53:44,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:53:44,529 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 14:53:44,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:53:44,535 INFO L85 PathProgramCache]: Analyzing trace with hash 592525310, now seen corresponding path program 1 times [2024-10-13 14:53:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:53:44,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952435445] [2024-10-13 14:53:44,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:53:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:53:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:44,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:53:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:44,866 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 14:53:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:53:44,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952435445] [2024-10-13 14:53:44,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952435445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:53:44,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:53:44,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:53:44,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271188993] [2024-10-13 14:53:44,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:53:44,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:53:44,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:53:44,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:53:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:53:44,961 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 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) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 14:53:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:53:45,024 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2024-10-13 14:53:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:53:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2024-10-13 14:53:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:53:45,033 INFO L225 Difference]: With dead ends: 59 [2024-10-13 14:53:45,034 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 14:53:45,036 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 14:53:45,039 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:53:45,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 125 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:53:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 14:53:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-10-13 14:53:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 40 states have internal predecessors, (50), 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 14:53:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-10-13 14:53:45,073 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 11 [2024-10-13 14:53:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:53:45,074 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-10-13 14:53:45,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 14:53:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-10-13 14:53:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 14:53:45,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:53:45,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:53:45,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 14:53:45,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:53:45,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:53:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1188415490, now seen corresponding path program 1 times [2024-10-13 14:53:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:53:45,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127103080] [2024-10-13 14:53:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:53:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:53:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:53:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,145 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 14:53:45,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:53:45,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127103080] [2024-10-13 14:53:45,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127103080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:53:45,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:53:45,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:53:45,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149671669] [2024-10-13 14:53:45,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:53:45,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:53:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:53:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:53:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:53:45,150 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 14:53:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:53:45,189 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2024-10-13 14:53:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:53:45,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-10-13 14:53:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:53:45,193 INFO L225 Difference]: With dead ends: 94 [2024-10-13 14:53:45,193 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 14:53:45,194 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 14:53:45,196 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:53:45,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 123 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:53:45,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 14:53:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-13 14:53:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 41 states have internal predecessors, (52), 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 14:53:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2024-10-13 14:53:45,209 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 12 [2024-10-13 14:53:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:53:45,210 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2024-10-13 14:53:45,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 14:53:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2024-10-13 14:53:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 14:53:45,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:53:45,212 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:53:45,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 14:53:45,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:53:45,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:53:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash -859746870, now seen corresponding path program 1 times [2024-10-13 14:53:45,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:53:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505826230] [2024-10-13 14:53:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:53:45,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:53:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:53:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 14:53:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,310 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 14:53:45,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:53:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505826230] [2024-10-13 14:53:45,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505826230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:53:45,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:53:45,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:53:45,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338973424] [2024-10-13 14:53:45,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:53:45,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:53:45,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:53:45,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:53:45,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:53:45,313 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14:53:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:53:45,333 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2024-10-13 14:53:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:53:45,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 20 [2024-10-13 14:53:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:53:45,337 INFO L225 Difference]: With dead ends: 86 [2024-10-13 14:53:45,338 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 14:53:45,339 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 14:53:45,340 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:53:45,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:53:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 14:53:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 14:53:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 39 states have internal predecessors, (47), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 14:53:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-10-13 14:53:45,353 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 20 [2024-10-13 14:53:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:53:45,353 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-10-13 14:53:45,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14:53:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-10-13 14:53:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 14:53:45,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:53:45,354 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:53:45,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 14:53:45,355 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 14:53:45,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:53:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash 155214931, now seen corresponding path program 1 times [2024-10-13 14:53:45,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:53:45,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399573855] [2024-10-13 14:53:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:53:45,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:53:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:53:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 14:53:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,441 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 14:53:45,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:53:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399573855] [2024-10-13 14:53:45,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399573855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:53:45,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:53:45,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:53:45,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205717833] [2024-10-13 14:53:45,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:53:45,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:53:45,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:53:45,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:53:45,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:53:45,444 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14:53:45,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:53:45,474 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-13 14:53:45,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:53:45,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 21 [2024-10-13 14:53:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:53:45,476 INFO L225 Difference]: With dead ends: 49 [2024-10-13 14:53:45,476 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 14:53:45,476 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 14:53:45,478 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:53:45,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 92 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:53:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 14:53:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-10-13 14:53:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 38 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 14:53:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-10-13 14:53:45,485 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 21 [2024-10-13 14:53:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:53:45,486 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-10-13 14:53:45,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14:53:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-10-13 14:53:45,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 14:53:45,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:53:45,488 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:53:45,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 14:53:45,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:53:45,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:53:45,489 INFO L85 PathProgramCache]: Analyzing trace with hash 516695653, now seen corresponding path program 1 times [2024-10-13 14:53:45,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:53:45,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25263411] [2024-10-13 14:53:45,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:53:45,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:53:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:53:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 14:53:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,559 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 14:53:45,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:53:45,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25263411] [2024-10-13 14:53:45,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25263411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:53:45,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:53:45,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:53:45,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080968641] [2024-10-13 14:53:45,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:53:45,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:53:45,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:53:45,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:53:45,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:53:45,564 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 14:53:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:53:45,602 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2024-10-13 14:53:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:53:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 22 [2024-10-13 14:53:45,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:53:45,603 INFO L225 Difference]: With dead ends: 74 [2024-10-13 14:53:45,603 INFO L226 Difference]: Without dead ends: 49 [2024-10-13 14:53:45,604 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 14:53:45,605 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:53:45,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 99 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:53:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-13 14:53:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-10-13 14:53:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 39 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 14:53:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-10-13 14:53:45,616 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 22 [2024-10-13 14:53:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:53:45,617 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-10-13 14:53:45,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 14:53:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-10-13 14:53:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 14:53:45,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:53:45,619 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] [2024-10-13 14:53:45,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 14:53:45,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:53:45,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:53:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1147060726, now seen corresponding path program 1 times [2024-10-13 14:53:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:53:45,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523349973] [2024-10-13 14:53:45,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:53:45,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:53:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:53:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 14:53:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,682 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 14:53:45,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:53:45,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523349973] [2024-10-13 14:53:45,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523349973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:53:45,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:53:45,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:53:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647855073] [2024-10-13 14:53:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:53:45,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:53:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:53:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:53:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:53:45,684 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 14:53:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:53:45,717 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2024-10-13 14:53:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:53:45,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2024-10-13 14:53:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:53:45,719 INFO L225 Difference]: With dead ends: 84 [2024-10-13 14:53:45,720 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 14:53:45,721 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 14:53:45,722 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:53:45,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 42 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:53:45,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 14:53:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-13 14:53:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 14:53:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-10-13 14:53:45,734 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 23 [2024-10-13 14:53:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:53:45,734 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-10-13 14:53:45,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 14:53:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-10-13 14:53:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 14:53:45,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:53:45,735 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] [2024-10-13 14:53:45,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 14:53:45,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:53:45,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:53:45,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1323064200, now seen corresponding path program 1 times [2024-10-13 14:53:45,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:53:45,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534815591] [2024-10-13 14:53:45,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:53:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:53:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:53:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 14:53:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 14:53:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,797 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 14:53:45,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:53:45,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534815591] [2024-10-13 14:53:45,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534815591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:53:45,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:53:45,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:53:45,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912439396] [2024-10-13 14:53:45,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:53:45,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:53:45,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:53:45,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:53:45,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:53:45,800 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (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 14:53:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:53:45,818 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-10-13 14:53:45,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:53:45,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (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 30 [2024-10-13 14:53:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:53:45,820 INFO L225 Difference]: With dead ends: 44 [2024-10-13 14:53:45,821 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 14:53:45,821 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 14:53:45,822 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:53:45,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 84 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:53:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 14:53:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 14:53:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 14:53:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-13 14:53:45,829 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 30 [2024-10-13 14:53:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:53:45,831 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-13 14:53:45,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (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 14:53:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-13 14:53:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 14:53:45,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:53:45,836 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] [2024-10-13 14:53:45,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 14:53:45,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:53:45,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:53:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1836406295, now seen corresponding path program 1 times [2024-10-13 14:53:45,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:53:45,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004221328] [2024-10-13 14:53:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:53:45,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:53:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:53:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 14:53:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 14:53:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 14:53:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:53:45,915 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 14:53:45,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:53:45,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004221328] [2024-10-13 14:53:45,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004221328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:53:45,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:53:45,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:53:45,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898561920] [2024-10-13 14:53:45,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:53:45,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:53:45,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:53:45,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:53:45,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:53:45,919 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 14:53:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:53:45,937 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-10-13 14:53:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:53:45,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-13 14:53:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:53:45,939 INFO L225 Difference]: With dead ends: 42 [2024-10-13 14:53:45,939 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 14:53:45,939 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 14:53:45,941 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:53:45,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 83 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:53:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 14:53:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 14:53:45,945 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 14:53:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 14:53:45,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-10-13 14:53:45,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:53:45,946 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 14:53:45,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 14:53:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 14:53:45,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 14:53:45,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 14:53:45,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 14:53:45,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 14:53:45,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 14:53:45,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 14:53:45,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 14:53:45,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 14:53:45,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 14:53:45,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 14:53:45,981 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:53:45,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 14:53:46,096 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 14:53:46,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:53:46 BoogieIcfgContainer [2024-10-13 14:53:46,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 14:53:46,111 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 14:53:46,111 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 14:53:46,112 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 14:53:46,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:53:44" (3/4) ... [2024-10-13 14:53:46,114 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 14:53:46,117 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 14:53:46,117 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 14:53:46,121 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-13 14:53:46,122 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-13 14:53:46,122 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 14:53:46,122 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 14:53:46,222 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 14:53:46,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 14:53:46,223 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 14:53:46,223 INFO L158 Benchmark]: Toolchain (without parser) took 3344.85ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 67.3MB in the beginning and 140.8MB in the end (delta: -73.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:53:46,224 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:53:46,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1042.17ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 67.0MB in the beginning and 97.5MB in the end (delta: -30.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-10-13 14:53:46,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.58ms. Allocated memory is still 184.5MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:53:46,227 INFO L158 Benchmark]: Boogie Preprocessor took 45.17ms. Allocated memory is still 184.5MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:53:46,227 INFO L158 Benchmark]: RCFGBuilder took 408.16ms. Allocated memory is still 184.5MB. Free memory was 91.3MB in the beginning and 74.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 14:53:46,228 INFO L158 Benchmark]: TraceAbstraction took 1673.35ms. Allocated memory is still 184.5MB. Free memory was 73.4MB in the beginning and 146.1MB in the end (delta: -72.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-10-13 14:53:46,228 INFO L158 Benchmark]: Witness Printer took 111.46ms. Allocated memory is still 184.5MB. Free memory was 146.1MB in the beginning and 140.8MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 14:53:46,229 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.16ms. Allocated memory is still 142.6MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1042.17ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 67.0MB in the beginning and 97.5MB in the end (delta: -30.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.58ms. Allocated memory is still 184.5MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.17ms. Allocated memory is still 184.5MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 408.16ms. Allocated memory is still 184.5MB. Free memory was 91.3MB in the beginning and 74.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1673.35ms. Allocated memory is still 184.5MB. Free memory was 73.4MB in the beginning and 146.1MB in the end (delta: -72.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Witness Printer took 111.46ms. Allocated memory is still 184.5MB. Free memory was 146.1MB in the beginning and 140.8MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1587]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1587]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: 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, 58 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 701 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 419 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 26/26 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 14:53:46,258 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