./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_22_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_22_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ec7a0b49047ff5c05b905dcdd8f78cb997cafd8d829ad3cf6a5dee5b3edf228d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:15:40,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:15:40,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 23:15:40,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:15:40,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:15:40,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:15:40,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:15:40,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:15:40,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:15:40,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:15:40,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:15:40,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:15:40,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:15:40,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:15:40,867 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:15:40,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:15:40,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:15:40,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:15:40,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:15:40,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:15:40,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:15:40,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:15:40,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:15:40,872 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:15:40,872 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:15:40,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:15:40,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:15:40,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:15:40,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:15:40,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:15:40,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:15:40,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:15:40,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:15:40,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:15:40,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:15:40,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:15:40,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:15:40,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:15:40,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:15:40,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:15:40,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:15:40,878 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec7a0b49047ff5c05b905dcdd8f78cb997cafd8d829ad3cf6a5dee5b3edf228d [2024-10-11 23:15:41,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:15:41,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:15:41,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:15:41,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:15:41,158 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:15:41,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_22_good.i [2024-10-11 23:15:42,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:15:42,939 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:15:42,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_22_good.i [2024-10-11 23:15:42,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9a21ef59a/538b059d866541988465f4cd6fb11cad/FLAG0e888d991 [2024-10-11 23:15:42,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9a21ef59a/538b059d866541988465f4cd6fb11cad [2024-10-11 23:15:42,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:15:42,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:15:42,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:15:42,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:15:42,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:15:42,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:15:42" (1/1) ... [2024-10-11 23:15:42,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600f8381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:42, skipping insertion in model container [2024-10-11 23:15:42,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:15:42" (1/1) ... [2024-10-11 23:15:43,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:15:43,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:15:43,848 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:15:43,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:15:44,062 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:15:44,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44 WrapperNode [2024-10-11 23:15:44,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:15:44,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:15:44,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:15:44,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:15:44,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,126 INFO L138 Inliner]: procedures = 503, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 92 [2024-10-11 23:15:44,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:15:44,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:15:44,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:15:44,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:15:44,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,150 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 23:15:44,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:15:44,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:15:44,164 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:15:44,164 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:15:44,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (1/1) ... [2024-10-11 23:15:44,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:15:44,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:15:44,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 23:15:44,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 23:15:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 23:15:44,241 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 23:15:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 23:15:44,242 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 23:15:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:15:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:15:44,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:15:44,365 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:15:44,367 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:15:44,507 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-11 23:15:44,508 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:15:44,553 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:15:44,553 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 23:15:44,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:44 BoogieIcfgContainer [2024-10-11 23:15:44,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:15:44,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:15:44,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:15:44,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:15:44,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:15:42" (1/3) ... [2024-10-11 23:15:44,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3078a409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:15:44, skipping insertion in model container [2024-10-11 23:15:44,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:44" (2/3) ... [2024-10-11 23:15:44,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3078a409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:15:44, skipping insertion in model container [2024-10-11 23:15:44,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:44" (3/3) ... [2024-10-11 23:15:44,563 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_postdec_22_good.i [2024-10-11 23:15:44,576 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:15:44,576 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 23:15:44,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:15:44,628 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;@10d9d584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:15:44,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 23:15:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 33 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 23:15:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 23:15:44,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:44,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:44,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:15:44,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:44,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1073040488, now seen corresponding path program 1 times [2024-10-11 23:15:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:44,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692833127] [2024-10-11 23:15:44,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:44,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:15:44,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:44,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692833127] [2024-10-11 23:15:44,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692833127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:44,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:44,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:15:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282990688] [2024-10-11 23:15:44,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:44,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:15:44,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:45,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:15:45,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:15:45,054 INFO L87 Difference]: Start difference. First operand has 44 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 33 states have internal predecessors, (39), 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11 23:15:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:45,129 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2024-10-11 23:15:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:15:45,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-10-11 23:15:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:45,137 INFO L225 Difference]: With dead ends: 74 [2024-10-11 23:15:45,140 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 23:15:45,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:15:45,147 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:45,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 23:15:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-11 23:15:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 23:15:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-10-11 23:15:45,180 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 10 [2024-10-11 23:15:45,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:45,182 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-11 23:15:45,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11 23:15:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-10-11 23:15:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 23:15:45,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:45,183 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:45,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:15:45,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:15:45,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1562472497, now seen corresponding path program 1 times [2024-10-11 23:15:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:45,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646813326] [2024-10-11 23:15:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:45,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 23:15:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 23:15:45,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:45,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646813326] [2024-10-11 23:15:45,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646813326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:45,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:45,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:15:45,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409606486] [2024-10-11 23:15:45,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:45,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:15:45,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:45,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:15:45,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:15:45,289 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:15:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:45,304 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-10-11 23:15:45,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:15:45,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 18 [2024-10-11 23:15:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:45,305 INFO L225 Difference]: With dead ends: 55 [2024-10-11 23:15:45,305 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 23:15:45,306 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-11 23:15:45,309 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:45,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 23:15:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 23:15:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:15:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-10-11 23:15:45,315 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2024-10-11 23:15:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:45,316 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-10-11 23:15:45,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:15:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-10-11 23:15:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 23:15:45,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:45,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:45,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 23:15:45,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:15:45,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash -467098996, now seen corresponding path program 1 times [2024-10-11 23:15:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:45,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393939478] [2024-10-11 23:15:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:45,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 23:15:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 23:15:45,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:45,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393939478] [2024-10-11 23:15:45,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393939478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:45,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:45,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:15:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642540002] [2024-10-11 23:15:45,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:45,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:15:45,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:15:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:15:45,397 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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-11 23:15:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:45,421 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-10-11 23:15:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:15:45,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-11 23:15:45,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:45,423 INFO L225 Difference]: With dead ends: 37 [2024-10-11 23:15:45,423 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 23:15:45,423 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-11 23:15:45,425 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:45,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 23:15:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-10-11 23:15:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:15:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-11 23:15:45,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2024-10-11 23:15:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:45,434 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-11 23:15:45,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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-11 23:15:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-11 23:15:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 23:15:45,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:45,436 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:45,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:15:45,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:15:45,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1594631057, now seen corresponding path program 1 times [2024-10-11 23:15:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:45,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653876696] [2024-10-11 23:15:45,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 23:15:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 23:15:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:45,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653876696] [2024-10-11 23:15:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653876696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:45,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:45,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:15:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996833986] [2024-10-11 23:15:45,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:45,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:45,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:45,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:45,551 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:15:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:45,574 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-10-11 23:15:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:45,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 23:15:45,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:45,576 INFO L225 Difference]: With dead ends: 32 [2024-10-11 23:15:45,577 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 23:15:45,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:45,578 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:45,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 58 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 23:15:45,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 23:15:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:15:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-10-11 23:15:45,587 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2024-10-11 23:15:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:45,587 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-11 23:15:45,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:15:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-10-11 23:15:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 23:15:45,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:45,589 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:45,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:15:45,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:15:45,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:45,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1395758052, now seen corresponding path program 1 times [2024-10-11 23:15:45,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:45,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702395667] [2024-10-11 23:15:45,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:45,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 23:15:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 23:15:45,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:45,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702395667] [2024-10-11 23:15:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702395667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:45,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:15:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85256389] [2024-10-11 23:15:45,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:45,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:45,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:45,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:45,685 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 23:15:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:45,706 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-10-11 23:15:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:45,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 27 [2024-10-11 23:15:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:45,708 INFO L225 Difference]: With dead ends: 26 [2024-10-11 23:15:45,708 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 23:15:45,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:45,709 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:45,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 23:15:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-11 23:15:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:15:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-10-11 23:15:45,717 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 27 [2024-10-11 23:15:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:45,719 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-11 23:15:45,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 23:15:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-10-11 23:15:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 23:15:45,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:45,720 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:45,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 23:15:45,721 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:15:45,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash 318826750, now seen corresponding path program 1 times [2024-10-11 23:15:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:45,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922914904] [2024-10-11 23:15:45,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:45,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 23:15:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 23:15:45,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:45,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922914904] [2024-10-11 23:15:45,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922914904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:45,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:45,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:15:45,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826903005] [2024-10-11 23:15:45,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:45,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:45,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:45,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:45,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:45,802 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 23:15:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:45,826 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-10-11 23:15:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:45,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 28 [2024-10-11 23:15:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:45,827 INFO L225 Difference]: With dead ends: 25 [2024-10-11 23:15:45,827 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 23:15:45,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:45,828 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:45,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:45,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 23:15:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 23:15:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:15:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 23:15:45,829 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2024-10-11 23:15:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:45,829 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 23:15:45,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 23:15:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 23:15:45,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 23:15:45,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 23:15:45,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 23:15:45,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 23:15:45,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 23:15:45,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 23:15:45,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 23:15:45,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 23:15:45,844 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 23:15:45,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 23:15:45,899 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 23:15:45,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:15:45 BoogieIcfgContainer [2024-10-11 23:15:45,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 23:15:45,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 23:15:45,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 23:15:45,915 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 23:15:45,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:44" (3/4) ... [2024-10-11 23:15:45,917 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 23:15:45,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 23:15:45,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 23:15:45,926 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-11 23:15:45,927 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 23:15:45,927 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 23:15:45,927 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 23:15:46,021 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 23:15:46,022 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 23:15:46,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 23:15:46,023 INFO L158 Benchmark]: Toolchain (without parser) took 3034.92ms. Allocated memory was 151.0MB in the beginning and 216.0MB in the end (delta: 65.0MB). Free memory was 74.8MB in the beginning and 96.6MB in the end (delta: -21.8MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2024-10-11 23:15:46,023 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:15:46,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1074.15ms. Allocated memory was 151.0MB in the beginning and 216.0MB in the end (delta: 65.0MB). Free memory was 74.6MB in the beginning and 138.5MB in the end (delta: -63.9MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-10-11 23:15:46,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.76ms. Allocated memory is still 216.0MB. Free memory was 138.5MB in the beginning and 135.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:15:46,024 INFO L158 Benchmark]: Boogie Preprocessor took 36.51ms. Allocated memory is still 216.0MB. Free memory was 135.3MB in the beginning and 133.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:15:46,024 INFO L158 Benchmark]: RCFGBuilder took 389.73ms. Allocated memory is still 216.0MB. Free memory was 133.2MB in the beginning and 115.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 23:15:46,024 INFO L158 Benchmark]: TraceAbstraction took 1357.05ms. Allocated memory is still 216.0MB. Free memory was 114.4MB in the beginning and 101.8MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 23:15:46,024 INFO L158 Benchmark]: Witness Printer took 108.29ms. Allocated memory is still 216.0MB. Free memory was 101.8MB in the beginning and 96.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 23:15:46,027 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.23ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1074.15ms. Allocated memory was 151.0MB in the beginning and 216.0MB in the end (delta: 65.0MB). Free memory was 74.6MB in the beginning and 138.5MB in the end (delta: -63.9MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.76ms. Allocated memory is still 216.0MB. Free memory was 138.5MB in the beginning and 135.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.51ms. Allocated memory is still 216.0MB. Free memory was 135.3MB in the beginning and 133.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.73ms. Allocated memory is still 216.0MB. Free memory was 133.2MB in the beginning and 115.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1357.05ms. Allocated memory is still 216.0MB. Free memory was 114.4MB in the beginning and 101.8MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 108.29ms. Allocated memory is still 216.0MB. Free memory was 101.8MB in the beginning and 96.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1621]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1621]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: 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, 44 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 304 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 148 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 36/36 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 23:15:46,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE