./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_rand_postinc_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 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_rand_postinc_12_bad.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 dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 22:30:31,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 22:30:31,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 22:30:31,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 22:30:31,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 22:30:31,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 22:30:31,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 22:30:31,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 22:30:31,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 22:30:31,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 22:30:31,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 22:30:31,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 22:30:31,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 22:30:31,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 22:30:31,282 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 22:30:31,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 22:30:31,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 22:30:31,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 22:30:31,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 22:30:31,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 22:30:31,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 22:30:31,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 22:30:31,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 22:30:31,285 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 22:30:31,285 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 22:30:31,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 22:30:31,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 22:30:31,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 22:30:31,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 22:30:31,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 22:30:31,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 22:30:31,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:30:31,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 22:30:31,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 22:30:31,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 22:30:31,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 22:30:31,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 22:30:31,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 22:30:31,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 22:30:31,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 22:30:31,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 22:30:31,293 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 -> dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 [2024-10-14 22:30:31,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 22:30:31,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 22:30:31,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 22:30:31,588 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 22:30:31,589 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 22:30:31,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-10-14 22:30:33,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 22:30:33,540 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 22:30:33,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-10-14 22:30:33,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b811e42/6fee355e637e40b099989113adc06508/FLAG72248cb68 [2024-10-14 22:30:33,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b811e42/6fee355e637e40b099989113adc06508 [2024-10-14 22:30:33,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 22:30:33,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 22:30:33,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 22:30:33,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 22:30:33,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 22:30:33,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:30:33" (1/1) ... [2024-10-14 22:30:33,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a0637cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:33, skipping insertion in model container [2024-10-14 22:30:33,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:30:33" (1/1) ... [2024-10-14 22:30:33,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 22:30:34,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:30:34,614 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 22:30:34,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:30:34,896 INFO L204 MainTranslator]: Completed translation [2024-10-14 22:30:34,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34 WrapperNode [2024-10-14 22:30:34,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 22:30:34,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 22:30:34,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 22:30:34,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 22:30:34,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:34,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:34,977 INFO L138 Inliner]: procedures = 497, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2024-10-14 22:30:34,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 22:30:34,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 22:30:34,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 22:30:34,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 22:30:34,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:34,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:34,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:35,007 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 22:30:35,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:35,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:35,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:35,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:35,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:35,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:35,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 22:30:35,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 22:30:35,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 22:30:35,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 22:30:35,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (1/1) ... [2024-10-14 22:30:35,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:30:35,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:30:35,069 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-14 22:30:35,072 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-14 22:30:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-14 22:30:35,123 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-14 22:30:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-10-14 22:30:35,123 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-10-14 22:30:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 22:30:35,124 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 22:30:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 22:30:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 22:30:35,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 22:30:35,291 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 22:30:35,295 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 22:30:35,556 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-10-14 22:30:35,556 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 22:30:35,593 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 22:30:35,593 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 22:30:35,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:35 BoogieIcfgContainer [2024-10-14 22:30:35,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 22:30:35,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 22:30:35,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 22:30:35,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 22:30:35,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:30:33" (1/3) ... [2024-10-14 22:30:35,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adc98e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:30:35, skipping insertion in model container [2024-10-14 22:30:35,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:34" (2/3) ... [2024-10-14 22:30:35,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adc98e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:30:35, skipping insertion in model container [2024-10-14 22:30:35,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:35" (3/3) ... [2024-10-14 22:30:35,608 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-10-14 22:30:35,624 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 22:30:35,625 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 22:30:35,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 22:30:35,675 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;@7e0a5059, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 22:30:35,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 22:30:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 47 states have internal predecessors, (64), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 22:30:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 22:30:35,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:30:35,686 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:30:35,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 22:30:35,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:30:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1527888929, now seen corresponding path program 1 times [2024-10-14 22:30:35,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:30:35,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391009052] [2024-10-14 22:30:35,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:30:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:30:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:30:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 22:30:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 22:30:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:30:36,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:30:36,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391009052] [2024-10-14 22:30:36,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391009052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:30:36,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:30:36,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 22:30:36,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961463830] [2024-10-14 22:30:36,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:30:36,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 22:30:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:30:36,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 22:30:36,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 22:30:36,218 INFO L87 Difference]: Start difference. First operand has 58 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 47 states have internal predecessors, (64), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:30:36,320 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2024-10-14 22:30:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 22:30:36,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2024-10-14 22:30:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:30:36,332 INFO L225 Difference]: With dead ends: 76 [2024-10-14 22:30:36,332 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 22:30:36,336 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-14 22:30:36,342 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 22:30:36,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 215 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 22:30:36,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 22:30:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-10-14 22:30:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 42 states have internal predecessors, (57), 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-14 22:30:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-10-14 22:30:36,393 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 18 [2024-10-14 22:30:36,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:30:36,396 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-10-14 22:30:36,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-10-14 22:30:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 22:30:36,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:30:36,398 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:30:36,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 22:30:36,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 22:30:36,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:30:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash -119908425, now seen corresponding path program 1 times [2024-10-14 22:30:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:30:36,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64271360] [2024-10-14 22:30:36,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:30:36,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:30:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:30:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 22:30:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 22:30:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:30:36,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:30:36,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64271360] [2024-10-14 22:30:36,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64271360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:30:36,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:30:36,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 22:30:36,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343046699] [2024-10-14 22:30:36,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:30:36,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 22:30:36,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:30:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 22:30:36,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 22:30:36,556 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:30:36,597 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2024-10-14 22:30:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 22:30:36,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-14 22:30:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:30:36,600 INFO L225 Difference]: With dead ends: 54 [2024-10-14 22:30:36,600 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 22:30:36,601 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-14 22:30:36,603 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 174 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-14 22:30:36,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 174 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:30:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 22:30:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 22:30:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 40 states have internal predecessors, (54), 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-14 22:30:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2024-10-14 22:30:36,614 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 19 [2024-10-14 22:30:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:30:36,614 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2024-10-14 22:30:36,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2024-10-14 22:30:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 22:30:36,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:30:36,616 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:30:36,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 22:30:36,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 22:30:36,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:30:36,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348604, now seen corresponding path program 1 times [2024-10-14 22:30:36,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:30:36,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269267169] [2024-10-14 22:30:36,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:30:36,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:30:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:30:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 22:30:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 22:30:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:30:36,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:30:36,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269267169] [2024-10-14 22:30:36,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269267169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:30:36,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:30:36,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 22:30:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200528396] [2024-10-14 22:30:36,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:30:36,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 22:30:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:30:36,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 22:30:36,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 22:30:36,944 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:30:37,073 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-10-14 22:30:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 22:30:37,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-14 22:30:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:30:37,075 INFO L225 Difference]: With dead ends: 55 [2024-10-14 22:30:37,075 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 22:30:37,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 22:30:37,077 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 22:30:37,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 302 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 22:30:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 22:30:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-10-14 22:30:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 45 states have internal predecessors, (60), 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-14 22:30:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2024-10-14 22:30:37,098 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 24 [2024-10-14 22:30:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:30:37,099 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2024-10-14 22:30:37,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2024-10-14 22:30:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 22:30:37,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:30:37,100 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:30:37,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 22:30:37,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 22:30:37,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:30:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1526794262, now seen corresponding path program 1 times [2024-10-14 22:30:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:30:37,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317771394] [2024-10-14 22:30:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:30:37,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:30:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:37,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:30:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:37,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 22:30:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:37,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 22:30:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:30:37,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:30:37,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317771394] [2024-10-14 22:30:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317771394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:30:37,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:30:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 22:30:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145519700] [2024-10-14 22:30:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:30:37,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 22:30:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:30:37,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 22:30:37,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 22:30:37,310 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:30:37,335 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2024-10-14 22:30:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 22:30:37,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-14 22:30:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:30:37,337 INFO L225 Difference]: With dead ends: 52 [2024-10-14 22:30:37,337 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 22:30:37,338 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-14 22:30:37,339 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:30:37,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 154 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:30:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 22:30:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-10-14 22:30:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 39 states have internal predecessors, (53), 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-14 22:30:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2024-10-14 22:30:37,348 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 24 [2024-10-14 22:30:37,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:30:37,349 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2024-10-14 22:30:37,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2024-10-14 22:30:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 22:30:37,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:30:37,352 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:30:37,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 22:30:37,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 22:30:37,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:30:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash 441239994, now seen corresponding path program 1 times [2024-10-14 22:30:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:30:37,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478396417] [2024-10-14 22:30:37,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:30:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:30:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:37,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:30:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:37,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 22:30:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:37,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 22:30:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:30:37,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:30:37,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478396417] [2024-10-14 22:30:37,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478396417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:30:37,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:30:37,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 22:30:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770942824] [2024-10-14 22:30:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:30:37,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 22:30:37,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:30:37,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 22:30:37,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 22:30:37,551 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:30:37,618 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2024-10-14 22:30:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 22:30:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-10-14 22:30:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:30:37,619 INFO L225 Difference]: With dead ends: 54 [2024-10-14 22:30:37,619 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 22:30:37,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 22:30:37,621 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 22:30:37,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 296 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 22:30:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 22:30:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-10-14 22:30:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 45 states have internal predecessors, (60), 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-14 22:30:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2024-10-14 22:30:37,632 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 25 [2024-10-14 22:30:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:30:37,633 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2024-10-14 22:30:37,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2024-10-14 22:30:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 22:30:37,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:30:37,636 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:30:37,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 22:30:37,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 22:30:37,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:30:37,637 INFO L85 PathProgramCache]: Analyzing trace with hash 441232018, now seen corresponding path program 1 times [2024-10-14 22:30:37,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:30:37,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226565578] [2024-10-14 22:30:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:30:37,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:30:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:30:37,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 22:30:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:30:37,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 22:30:37,704 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 22:30:37,706 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-14 22:30:37,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-14 22:30:37,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-14 22:30:37,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-14 22:30:37,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 22:30:37,714 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 22:30:37,748 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 22:30:37,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:30:37 BoogieIcfgContainer [2024-10-14 22:30:37,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 22:30:37,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 22:30:37,757 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 22:30:37,757 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 22:30:37,757 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:35" (3/4) ... [2024-10-14 22:30:37,759 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 22:30:37,761 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 22:30:37,761 INFO L158 Benchmark]: Toolchain (without parser) took 4166.66ms. Allocated memory was 161.5MB in the beginning and 245.4MB in the end (delta: 83.9MB). Free memory was 101.7MB in the beginning and 130.8MB in the end (delta: -29.1MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2024-10-14 22:30:37,762 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:30:37,762 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1300.44ms. Allocated memory was 161.5MB in the beginning and 245.4MB in the end (delta: 83.9MB). Free memory was 101.7MB in the beginning and 182.1MB in the end (delta: -80.4MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2024-10-14 22:30:37,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.66ms. Allocated memory is still 245.4MB. Free memory was 182.1MB in the beginning and 179.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:30:37,766 INFO L158 Benchmark]: Boogie Preprocessor took 48.50ms. Allocated memory is still 245.4MB. Free memory was 179.1MB in the beginning and 177.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:30:37,766 INFO L158 Benchmark]: RCFGBuilder took 566.35ms. Allocated memory is still 245.4MB. Free memory was 177.0MB in the beginning and 156.0MB in the end (delta: 21.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 22:30:37,766 INFO L158 Benchmark]: TraceAbstraction took 2159.85ms. Allocated memory is still 245.4MB. Free memory was 155.0MB in the beginning and 130.8MB in the end (delta: 24.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 22:30:37,766 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 245.4MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:30:37,768 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.20ms. Allocated memory is still 161.5MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1300.44ms. Allocated memory was 161.5MB in the beginning and 245.4MB in the end (delta: 83.9MB). Free memory was 101.7MB in the beginning and 182.1MB in the end (delta: -80.4MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.66ms. Allocated memory is still 245.4MB. Free memory was 182.1MB in the beginning and 179.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.50ms. Allocated memory is still 245.4MB. Free memory was 179.1MB in the beginning and 177.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 566.35ms. Allocated memory is still 245.4MB. Free memory was 177.0MB in the beginning and 156.0MB in the end (delta: 21.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2159.85ms. Allocated memory is still 245.4MB. Free memory was 155.0MB in the beginning and 130.8MB in the end (delta: 24.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 245.4MB. Free memory is still 130.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1585. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1586] CALL CWE190_Integer_Overflow__int_rand_postinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 1141 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 844 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 297 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 26, 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, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 197 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 10/10 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 22:30:37,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_rand_postinc_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.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 dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 22:30:40,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 22:30:40,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-14 22:30:40,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 22:30:40,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 22:30:40,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-14 22:30:40,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 22:30:40,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 22:30:40,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 22:30:40,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 22:30:40,264 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 22:30:40,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 22:30:40,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 22:30:40,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 22:30:40,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 22:30:40,269 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 22:30:40,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 22:30:40,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 22:30:40,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 22:30:40,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 22:30:40,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 22:30:40,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 22:30:40,271 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 22:30:40,271 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 22:30:40,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 22:30:40,272 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 22:30:40,272 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 22:30:40,272 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 22:30:40,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 22:30:40,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 22:30:40,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 22:30:40,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 22:30:40,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 22:30:40,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 22:30:40,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:30:40,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 22:30:40,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 22:30:40,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 22:30:40,277 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 22:30:40,278 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 22:30:40,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 22:30:40,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 22:30:40,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 22:30:40,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 22:30:40,279 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 22:30:40,280 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 -> dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 [2024-10-14 22:30:40,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 22:30:40,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 22:30:40,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 22:30:40,658 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 22:30:40,659 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 22:30:40,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-10-14 22:30:42,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 22:30:42,561 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 22:30:42,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-10-14 22:30:42,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/817981a47/f6ef3097ceb14339b3661a9d983b7dce/FLAG23956ac70 [2024-10-14 22:30:42,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/817981a47/f6ef3097ceb14339b3661a9d983b7dce [2024-10-14 22:30:42,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 22:30:42,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 22:30:42,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 22:30:42,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 22:30:42,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 22:30:42,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:30:42" (1/1) ... [2024-10-14 22:30:42,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653bbae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:42, skipping insertion in model container [2024-10-14 22:30:42,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:30:42" (1/1) ... [2024-10-14 22:30:42,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 22:30:43,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:30:43,461 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 22:30:43,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:30:43,651 INFO L204 MainTranslator]: Completed translation [2024-10-14 22:30:43,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43 WrapperNode [2024-10-14 22:30:43,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 22:30:43,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 22:30:43,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 22:30:43,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 22:30:43,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,720 INFO L138 Inliner]: procedures = 502, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-10-14 22:30:43,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 22:30:43,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 22:30:43,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 22:30:43,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 22:30:43,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,763 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 22:30:43,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 22:30:43,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 22:30:43,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 22:30:43,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 22:30:43,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (1/1) ... [2024-10-14 22:30:43,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:30:43,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:30:43,837 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-14 22:30:43,840 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-14 22:30:43,881 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-14 22:30:43,881 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-14 22:30:43,881 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-10-14 22:30:43,881 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-10-14 22:30:43,881 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 22:30:43,881 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 22:30:43,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 22:30:43,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 22:30:43,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 22:30:44,040 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 22:30:44,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 22:30:44,262 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-14 22:30:44,262 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 22:30:44,305 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 22:30:44,306 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 22:30:44,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:44 BoogieIcfgContainer [2024-10-14 22:30:44,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 22:30:44,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 22:30:44,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 22:30:44,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 22:30:44,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:30:42" (1/3) ... [2024-10-14 22:30:44,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27503255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:30:44, skipping insertion in model container [2024-10-14 22:30:44,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:43" (2/3) ... [2024-10-14 22:30:44,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27503255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:30:44, skipping insertion in model container [2024-10-14 22:30:44,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:44" (3/3) ... [2024-10-14 22:30:44,317 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-10-14 22:30:44,334 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 22:30:44,334 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 22:30:44,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 22:30:44,412 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6040b574, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 22:30:44,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 22:30:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 22:30:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 22:30:44,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:30:44,425 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:30:44,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 22:30:44,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:30:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash 657284848, now seen corresponding path program 1 times [2024-10-14 22:30:44,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:30:44,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248665643] [2024-10-14 22:30:44,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:30:44,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:30:44,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:30:44,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 22:30:44,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 22:30:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:44,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 22:30:44,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:30:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:30:44,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:30:44,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 22:30:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248665643] [2024-10-14 22:30:44,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248665643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:30:44,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:30:44,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 22:30:44,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775020339] [2024-10-14 22:30:44,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:30:44,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 22:30:44,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 22:30:44,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 22:30:44,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 22:30:44,639 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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-14 22:30:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:30:44,668 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-10-14 22:30:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 22:30:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16 [2024-10-14 22:30:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:30:44,677 INFO L225 Difference]: With dead ends: 36 [2024-10-14 22:30:44,677 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 22:30:44,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 22:30:44,687 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:30:44,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:30:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 22:30:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 22:30:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-14 22:30:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-14 22:30:44,725 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2024-10-14 22:30:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:30:44,727 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-14 22:30:44,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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-14 22:30:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-14 22:30:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 22:30:44,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:30:44,729 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:30:44,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 22:30:44,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:30:44,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 22:30:44,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:30:44,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1099006124, now seen corresponding path program 1 times [2024-10-14 22:30:44,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:30:44,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600066908] [2024-10-14 22:30:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:30:44,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:30:44,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:30:44,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 22:30:44,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 22:30:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:45,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 22:30:45,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:30:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:30:45,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:30:45,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 22:30:45,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600066908] [2024-10-14 22:30:45,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600066908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:30:45,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:30:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 22:30:45,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785268456] [2024-10-14 22:30:45,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:30:45,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 22:30:45,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 22:30:45,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 22:30:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 22:30:45,100 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:30:45,138 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-10-14 22:30:45,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 22:30:45,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2024-10-14 22:30:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:30:45,140 INFO L225 Difference]: With dead ends: 28 [2024-10-14 22:30:45,140 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 22:30:45,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-14 22:30:45,142 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:30:45,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:30:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 22:30:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-14 22:30:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-14 22:30:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-14 22:30:45,150 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2024-10-14 22:30:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:30:45,150 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-14 22:30:45,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-14 22:30:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 22:30:45,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:30:45,152 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:30:45,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 22:30:45,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:30:45,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 22:30:45,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:30:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash 290795859, now seen corresponding path program 1 times [2024-10-14 22:30:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:30:45,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390655776] [2024-10-14 22:30:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:30:45,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:30:45,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:30:45,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 22:30:45,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 22:30:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:30:45,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 22:30:45,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:30:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:30:45,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:30:45,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 22:30:45,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390655776] [2024-10-14 22:30:45,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390655776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:30:45,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:30:45,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 22:30:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553291883] [2024-10-14 22:30:45,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:30:45,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 22:30:45,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 22:30:45,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 22:30:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 22:30:45,467 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:30:45,489 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-10-14 22:30:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 22:30:45,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2024-10-14 22:30:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:30:45,491 INFO L225 Difference]: With dead ends: 28 [2024-10-14 22:30:45,491 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 22:30:45,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-14 22:30:45,492 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 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-14 22:30:45,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:30:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 22:30:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 22:30:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-14 22:30:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-14 22:30:45,496 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2024-10-14 22:30:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:30:45,496 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-14 22:30:45,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:30:45,497 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-14 22:30:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 22:30:45,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:30:45,497 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:30:45,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 22:30:45,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:30:45,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 22:30:45,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:30:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1283430033, now seen corresponding path program 1 times [2024-10-14 22:30:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:30:45,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923752627] [2024-10-14 22:30:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:30:45,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:30:45,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:30:45,703 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 22:30:45,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 22:30:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:30:45,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 22:30:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:30:45,832 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 22:30:45,832 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 22:30:45,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-14 22:30:45,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-14 22:30:45,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-14 22:30:45,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-14 22:30:45,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 22:30:46,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:30:46,040 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 22:30:46,061 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 22:30:46,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:30:46 BoogieIcfgContainer [2024-10-14 22:30:46,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 22:30:46,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 22:30:46,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 22:30:46,065 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 22:30:46,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:44" (3/4) ... [2024-10-14 22:30:46,068 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 22:30:46,070 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 22:30:46,070 INFO L158 Benchmark]: Toolchain (without parser) took 3452.76ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 45.4MB in the beginning and 37.8MB in the end (delta: 7.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-10-14 22:30:46,072 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 50.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:30:46,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1032.91ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 45.2MB in the beginning and 48.4MB in the end (delta: -3.2MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-10-14 22:30:46,075 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.21ms. Allocated memory is still 81.8MB. Free memory was 48.0MB in the beginning and 45.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 22:30:46,075 INFO L158 Benchmark]: Boogie Preprocessor took 75.22ms. Allocated memory is still 81.8MB. Free memory was 45.0MB in the beginning and 42.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:30:46,075 INFO L158 Benchmark]: RCFGBuilder took 509.92ms. Allocated memory is still 81.8MB. Free memory was 42.1MB in the beginning and 45.9MB in the end (delta: -3.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-10-14 22:30:46,076 INFO L158 Benchmark]: TraceAbstraction took 1755.83ms. Allocated memory is still 81.8MB. Free memory was 45.0MB in the beginning and 38.4MB in the end (delta: 6.6MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2024-10-14 22:30:46,076 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 81.8MB. Free memory was 38.2MB in the beginning and 37.8MB in the end (delta: 477.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:30:46,080 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.18ms. Allocated memory is still 50.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1032.91ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 45.2MB in the beginning and 48.4MB in the end (delta: -3.2MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.21ms. Allocated memory is still 81.8MB. Free memory was 48.0MB in the beginning and 45.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.22ms. Allocated memory is still 81.8MB. Free memory was 45.0MB in the beginning and 42.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 509.92ms. Allocated memory is still 81.8MB. Free memory was 42.1MB in the beginning and 45.9MB in the end (delta: -3.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1755.83ms. Allocated memory is still 81.8MB. Free memory was 45.0MB in the beginning and 38.4MB in the end (delta: 6.6MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 81.8MB. Free memory was 38.2MB in the beginning and 37.8MB in the end (delta: 477.4kB). Peak memory consumption was 2.1MB. 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 - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1585. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1586] CALL CWE190_Integer_Overflow__int_rand_postinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 84 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 66 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 6/6 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 22:30:46,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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: UNKNOWN: Overapproximated counterexample