/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:04:30,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:04:30,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:04:30,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:04:30,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:04:30,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:04:30,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:04:30,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:04:30,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:04:30,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:04:30,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:04:30,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:04:30,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:04:30,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:04:30,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:04:30,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:04:30,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:04:30,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:04:30,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:04:30,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:04:30,315 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:04:30,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:04:30,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:04:30,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:04:30,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:04:30,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:04:30,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:04:30,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:04:30,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:04:30,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:04:30,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:04:30,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:04:30,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:04:30,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:04:30,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:04:30,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:04:30,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:04:30,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:04:30,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:04:30,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:04:30,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:04:30,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:04:30,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:04:30,349 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:04:30,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:04:30,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:04:30,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:04:30,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:04:30,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:04:30,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:04:30,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:04:30,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:04:30,352 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:04:30,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:04:30,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:04:30,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:04:30,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:04:30,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:04:30,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:04:30,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:04:30,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:04:30,353 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:04:30,353 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:04:30,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:04:30,353 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:04:30,353 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:04:30,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:04:30,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:04:30,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:04:30,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:04:30,613 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:04:30,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-15 13:04:30,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddba18f16/3b3e46b8712f491d85d00b9b2e218d60/FLAGb67e89432 [2022-04-15 13:04:31,065 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:04:31,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-15 13:04:31,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddba18f16/3b3e46b8712f491d85d00b9b2e218d60/FLAGb67e89432 [2022-04-15 13:04:31,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddba18f16/3b3e46b8712f491d85d00b9b2e218d60 [2022-04-15 13:04:31,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:04:31,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:04:31,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:04:31,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:04:31,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:04:31,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:31" (1/1) ... [2022-04-15 13:04:31,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a36d126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:31, skipping insertion in model container [2022-04-15 13:04:31,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:31" (1/1) ... [2022-04-15 13:04:31,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:04:31,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:04:31,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c[321,334] [2022-04-15 13:04:31,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:04:31,691 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:04:31,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c[321,334] [2022-04-15 13:04:31,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:04:31,716 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:04:31,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:31 WrapperNode [2022-04-15 13:04:31,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:04:31,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:04:31,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:04:31,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:04:31,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:31" (1/1) ... [2022-04-15 13:04:31,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:31" (1/1) ... [2022-04-15 13:04:31,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:31" (1/1) ... [2022-04-15 13:04:31,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:31" (1/1) ... [2022-04-15 13:04:31,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:31" (1/1) ... [2022-04-15 13:04:31,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:31" (1/1) ... [2022-04-15 13:04:31,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:31" (1/1) ... [2022-04-15 13:04:31,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:04:31,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:04:31,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:04:31,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:04:31,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:31" (1/1) ... [2022-04-15 13:04:31,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:04:31,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:31,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:04:31,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:04:31,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:04:31,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:04:31,809 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:04:31,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:04:31,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:04:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:04:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:04:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:04:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:04:31,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:04:31,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:04:31,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:04:31,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:04:31,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:04:31,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:04:31,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:04:31,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:04:31,868 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:04:31,869 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:04:32,031 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:04:32,037 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:04:32,037 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 13:04:32,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:04:32 BoogieIcfgContainer [2022-04-15 13:04:32,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:04:32,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:04:32,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:04:32,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:04:32,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:04:31" (1/3) ... [2022-04-15 13:04:32,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af9b780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:04:32, skipping insertion in model container [2022-04-15 13:04:32,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:31" (2/3) ... [2022-04-15 13:04:32,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af9b780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:04:32, skipping insertion in model container [2022-04-15 13:04:32,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:04:32" (3/3) ... [2022-04-15 13:04:32,045 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-1.c [2022-04-15 13:04:32,049 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:04:32,049 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:04:32,112 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:04:32,117 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-15 13:04:32,117 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:04:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:04:32,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:32,154 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:32,155 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 1 times [2022-04-15 13:04:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:32,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2102331460] [2022-04-15 13:04:32,197 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:04:32,197 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 2 times [2022-04-15 13:04:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:32,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570929411] [2022-04-15 13:04:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:32,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:32,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:32,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-15 13:04:32,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-15 13:04:32,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #85#return; {31#true} is VALID [2022-04-15 13:04:32,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:32,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-15 13:04:32,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-15 13:04:32,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #85#return; {31#true} is VALID [2022-04-15 13:04:32,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2022-04-15 13:04:32,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {31#true} is VALID [2022-04-15 13:04:32,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {31#true} is VALID [2022-04-15 13:04:32,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {31#true} is VALID [2022-04-15 13:04:32,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {31#true} is VALID [2022-04-15 13:04:32,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {31#true} is VALID [2022-04-15 13:04:32,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-04-15 13:04:32,439 INFO L272 TraceCheckUtils]: 11: Hoare triple {32#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {32#false} is VALID [2022-04-15 13:04:32,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-15 13:04:32,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-15 13:04:32,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-15 13:04:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:32,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:32,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570929411] [2022-04-15 13:04:32,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570929411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:32,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:32,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:04:32,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:32,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2102331460] [2022-04-15 13:04:32,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2102331460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:32,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:32,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:04:32,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986593902] [2022-04-15 13:04:32,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:32,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:04:32,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:32,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:32,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:32,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:04:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:32,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:04:32,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:04:32,522 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:32,647 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-15 13:04:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:04:32,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:04:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-15 13:04:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-15 13:04:32,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-15 13:04:32,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:32,765 INFO L225 Difference]: With dead ends: 50 [2022-04-15 13:04:32,765 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 13:04:32,767 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:04:32,770 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:32,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:04:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 13:04:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 13:04:32,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:32,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:04:32,803 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:04:32,803 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:04:32,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:32,818 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 13:04:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 13:04:32,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:32,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:32,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 13:04:32,819 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 13:04:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:32,822 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 13:04:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 13:04:32,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:32,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:32,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:32,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:04:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-15 13:04:32,826 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-04-15 13:04:32,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:32,826 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-15 13:04:32,827 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:32,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-15 13:04:32,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 13:04:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:04:32,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:32,882 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:32,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:04:32,883 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:32,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 1 times [2022-04-15 13:04:32,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:32,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900531744] [2022-04-15 13:04:32,885 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:04:32,885 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 2 times [2022-04-15 13:04:32,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:32,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916729530] [2022-04-15 13:04:32,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:32,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:33,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:33,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {231#true} is VALID [2022-04-15 13:04:33,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-15 13:04:33,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} #85#return; {231#true} is VALID [2022-04-15 13:04:33,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:33,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {231#true} is VALID [2022-04-15 13:04:33,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-15 13:04:33,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #85#return; {231#true} is VALID [2022-04-15 13:04:33,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret9 := main(); {231#true} is VALID [2022-04-15 13:04:33,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {231#true} is VALID [2022-04-15 13:04:33,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {231#true} is VALID [2022-04-15 13:04:33,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {231#true} is VALID [2022-04-15 13:04:33,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {231#true} is VALID [2022-04-15 13:04:33,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {236#(= main_~v~0 0)} is VALID [2022-04-15 13:04:33,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {236#(= main_~v~0 0)} assume !(~v~0 % 4294967296 < 10); {232#false} is VALID [2022-04-15 13:04:33,056 INFO L272 TraceCheckUtils]: 11: Hoare triple {232#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {232#false} is VALID [2022-04-15 13:04:33,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#false} ~cond := #in~cond; {232#false} is VALID [2022-04-15 13:04:33,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#false} assume 0 == ~cond; {232#false} is VALID [2022-04-15 13:04:33,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-15 13:04:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:33,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916729530] [2022-04-15 13:04:33,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916729530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:33,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:33,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:33,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:33,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900531744] [2022-04-15 13:04:33,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900531744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:33,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:33,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:33,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280183782] [2022-04-15 13:04:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:33,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:04:33,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:33,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:33,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:33,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:04:33,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:33,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:04:33,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:04:33,078 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:33,194 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-15 13:04:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:04:33,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:04:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-15 13:04:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-15 13:04:33,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-15 13:04:33,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:33,256 INFO L225 Difference]: With dead ends: 49 [2022-04-15 13:04:33,256 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 13:04:33,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:04:33,257 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:33,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:04:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 13:04:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-04-15 13:04:33,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:33,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:04:33,264 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:04:33,264 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:04:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:33,266 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-15 13:04:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-15 13:04:33,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:33,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:33,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-15 13:04:33,268 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-15 13:04:33,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:33,270 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-15 13:04:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-15 13:04:33,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:33,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:33,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:33,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:04:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-15 13:04:33,272 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-04-15 13:04:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:33,272 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-15 13:04:33,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:33,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2022-04-15 13:04:33,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 13:04:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:04:33,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:33,304 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:33,304 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:04:33,304 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:33,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash -509289700, now seen corresponding path program 1 times [2022-04-15 13:04:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:33,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539022518] [2022-04-15 13:04:33,408 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:33,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1836574324, now seen corresponding path program 1 times [2022-04-15 13:04:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:33,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911184485] [2022-04-15 13:04:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:33,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:33,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:33,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-15 13:04:33,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-15 13:04:33,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {453#true} {453#true} #85#return; {453#true} is VALID [2022-04-15 13:04:33,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:33,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-15 13:04:33,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-15 13:04:33,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #85#return; {453#true} is VALID [2022-04-15 13:04:33,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret9 := main(); {453#true} is VALID [2022-04-15 13:04:33,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {453#true} is VALID [2022-04-15 13:04:33,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {453#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {453#true} is VALID [2022-04-15 13:04:33,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {453#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {453#true} is VALID [2022-04-15 13:04:33,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {453#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {453#true} is VALID [2022-04-15 13:04:33,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {453#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {458#(= main_~v~0 0)} is VALID [2022-04-15 13:04:33,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(= main_~v~0 0)} [91] L23-3-->L23-4_primed: Formula: (or (= v_main_~v~0_In_1 v_main_~v~0_Out_2) (and (= |v_main_#t~post8_Out_2| 0) (< (mod (+ 4294967295 v_main_~v~0_Out_2) 4294967296) 10) (<= v_main_~v~0_In_1 v_main_~v~0_Out_2))) InVars {main_~v~0=v_main_~v~0_In_1} OutVars{main_#t~post8=|v_main_#t~post8_Out_2|, main_~v~0=v_main_~v~0_Out_2} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {459#(or (not (<= (* 1073741824 (div (+ main_~v~0 4294967295) 4294967296)) (+ (div main_~v~0 4) 1073741821))) (= main_~v~0 0))} is VALID [2022-04-15 13:04:33,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#(or (not (<= (* 1073741824 (div (+ main_~v~0 4294967295) 4294967296)) (+ (div main_~v~0 4) 1073741821))) (= main_~v~0 0))} [90] L23-4_primed-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {460#(and (not (<= (* 1073741824 (div (+ main_~v~0 4294967295) 4294967296)) (+ (div main_~v~0 4) 1073741821))) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0))} is VALID [2022-04-15 13:04:33,735 INFO L272 TraceCheckUtils]: 12: Hoare triple {460#(and (not (<= (* 1073741824 (div (+ main_~v~0 4294967295) 4294967296)) (+ (div main_~v~0 4) 1073741821))) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0))} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {461#(or (<= 2 |__VERIFIER_assert_#in~cond|) (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))} is VALID [2022-04-15 13:04:33,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {461#(or (<= 2 |__VERIFIER_assert_#in~cond|) (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))} ~cond := #in~cond; {462#(or (<= 2 __VERIFIER_assert_~cond) (<= (+ 2 __VERIFIER_assert_~cond) 0))} is VALID [2022-04-15 13:04:33,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#(or (<= 2 __VERIFIER_assert_~cond) (<= (+ 2 __VERIFIER_assert_~cond) 0))} assume 0 == ~cond; {454#false} is VALID [2022-04-15 13:04:33,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-15 13:04:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:33,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:33,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911184485] [2022-04-15 13:04:33,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911184485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:33,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:33,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:04:33,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:33,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539022518] [2022-04-15 13:04:33,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539022518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:33,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:33,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:04:33,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450163943] [2022-04-15 13:04:33,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:33,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:04:33,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:33,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:33,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:33,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:04:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:04:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:04:33,900 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:34,796 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-04-15 13:04:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:04:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:04:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-15 13:04:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-15 13:04:34,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-15 13:04:34,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:34,896 INFO L225 Difference]: With dead ends: 49 [2022-04-15 13:04:34,897 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 13:04:34,897 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:04:34,898 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 93 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:34,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 58 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:04:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 13:04:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2022-04-15 13:04:34,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:34,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 31 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:34,970 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 31 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:34,971 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 31 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:34,978 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-15 13:04:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-15 13:04:34,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:34,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:34,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-15 13:04:34,980 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-15 13:04:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:34,992 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-15 13:04:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-15 13:04:34,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:34,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:34,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:34,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-15 13:04:34,996 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 17 [2022-04-15 13:04:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:34,996 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-15 13:04:34,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:34,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-15 13:04:35,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 13:04:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:04:35,045 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:35,045 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:35,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:04:35,050 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash 831837050, now seen corresponding path program 2 times [2022-04-15 13:04:35,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:35,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070573154] [2022-04-15 13:04:35,128 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:35,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1895679668, now seen corresponding path program 1 times [2022-04-15 13:04:35,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:35,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920886725] [2022-04-15 13:04:35,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:35,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:35,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:35,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {735#true} is VALID [2022-04-15 13:04:35,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#true} assume true; {735#true} is VALID [2022-04-15 13:04:35,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {735#true} {735#true} #85#return; {735#true} is VALID [2022-04-15 13:04:35,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {745#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:35,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {735#true} is VALID [2022-04-15 13:04:35,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {735#true} assume true; {735#true} is VALID [2022-04-15 13:04:35,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {735#true} {735#true} #85#return; {735#true} is VALID [2022-04-15 13:04:35,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {735#true} call #t~ret9 := main(); {735#true} is VALID [2022-04-15 13:04:35,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {735#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {735#true} is VALID [2022-04-15 13:04:35,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {735#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {735#true} is VALID [2022-04-15 13:04:35,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {735#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {735#true} is VALID [2022-04-15 13:04:35,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {735#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {735#true} is VALID [2022-04-15 13:04:35,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {740#(= main_~v~0 0)} is VALID [2022-04-15 13:04:35,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {740#(= main_~v~0 0)} [93] L23-3-->L23-4_primed: Formula: (or (= v_main_~v~0_In_2 v_main_~v~0_Out_4) (and (<= v_main_~v~0_In_2 v_main_~v~0_Out_4) (< (mod (+ 4294967295 v_main_~v~0_Out_4) 4294967296) 10) (= |v_main_#t~post8_Out_4| 0))) InVars {main_~v~0=v_main_~v~0_In_2} OutVars{main_#t~post8=|v_main_#t~post8_Out_4|, main_~v~0=v_main_~v~0_Out_4} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {741#(or (not (<= (* 1073741824 (div (+ main_~v~0 4294967295) 4294967296)) (+ (div main_~v~0 4) 1073741821))) (= main_~v~0 0))} is VALID [2022-04-15 13:04:35,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {741#(or (not (<= (* 1073741824 (div (+ main_~v~0 4294967295) 4294967296)) (+ (div main_~v~0 4) 1073741821))) (= main_~v~0 0))} [92] L23-4_primed-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {742#(and (not (<= (* 1073741824 (div (+ main_~v~0 4294967295) 4294967296)) (+ (div main_~v~0 4) 1073741821))) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0))} is VALID [2022-04-15 13:04:35,392 INFO L272 TraceCheckUtils]: 12: Hoare triple {742#(and (not (<= (* 1073741824 (div (+ main_~v~0 4294967295) 4294967296)) (+ (div main_~v~0 4) 1073741821))) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0))} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {743#(or (<= 2 |__VERIFIER_assert_#in~cond|) (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))} is VALID [2022-04-15 13:04:35,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {743#(or (<= 2 |__VERIFIER_assert_#in~cond|) (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))} ~cond := #in~cond; {744#(or (<= 2 __VERIFIER_assert_~cond) (<= (+ 2 __VERIFIER_assert_~cond) 0))} is VALID [2022-04-15 13:04:35,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {744#(or (<= 2 __VERIFIER_assert_~cond) (<= (+ 2 __VERIFIER_assert_~cond) 0))} assume 0 == ~cond; {736#false} is VALID [2022-04-15 13:04:35,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {736#false} assume !false; {736#false} is VALID [2022-04-15 13:04:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:35,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:35,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920886725] [2022-04-15 13:04:35,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920886725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:35,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:35,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:04:35,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:35,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070573154] [2022-04-15 13:04:35,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070573154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:35,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:35,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:04:35,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347630826] [2022-04-15 13:04:35,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:35,611 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:04:35,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:35,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:35,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:35,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 13:04:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:35,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 13:04:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:04:35,637 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:36,983 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-15 13:04:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:04:36,983 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:04:36,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-15 13:04:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-15 13:04:36,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-15 13:04:37,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:37,087 INFO L225 Difference]: With dead ends: 39 [2022-04-15 13:04:37,087 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 13:04:37,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-04-15 13:04:37,089 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 85 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:37,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 61 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:04:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 13:04:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 13:04:37,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:37,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:04:37,090 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:04:37,090 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:04:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:37,091 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 13:04:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:04:37,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:37,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:37,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 13:04:37,091 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 13:04:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:37,091 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 13:04:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:04:37,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:37,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:37,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:37,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:04:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 13:04:37,092 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-04-15 13:04:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:37,092 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 13:04:37,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:37,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 13:04:37,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:04:37,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:37,095 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 13:04:37,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 13:04:37,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 13:04:37,739 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 13:04:37,739 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 13:04:37,739 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 13:04:37,740 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 13:04:37,740 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 13:04:37,740 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 13:04:37,740 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 13:04:37,740 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 13:04:37,740 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 13:04:37,740 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 13:04:37,740 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 12 27) the Hoare annotation is: true [2022-04-15 13:04:37,740 INFO L878 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (< (mod main_~v~0 4294967296) 10))) (or (and .cse0 (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)))) (and .cse0 (or (= main_~v~0 1) (and (<= 1 main_~v~0) (< (mod (+ main_~v~0 4294967294) 4294967296) 10)))))) [2022-04-15 13:04:37,740 INFO L878 garLoopResultBuilder]: At program point L23-3(line 23) the Hoare annotation is: (or (= main_~v~0 0) (and (or (= main_~v~0 1) (and (<= 1 main_~v~0) (< (mod (+ main_~v~0 4294967294) 4294967296) 10))) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) [2022-04-15 13:04:37,740 INFO L878 garLoopResultBuilder]: At program point L23-4(line 23) the Hoare annotation is: (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-15 13:04:37,741 INFO L878 garLoopResultBuilder]: At program point L19-2(lines 19 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-04-15 13:04:37,741 INFO L878 garLoopResultBuilder]: At program point L19-3(lines 19 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-04-15 13:04:37,741 INFO L885 garLoopResultBuilder]: At program point L19-4(lines 19 25) the Hoare annotation is: true [2022-04-15 13:04:37,741 INFO L878 garLoopResultBuilder]: At program point L24(lines 22 25) the Hoare annotation is: (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-15 13:04:37,741 INFO L878 garLoopResultBuilder]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-04-15 13:04:37,741 INFO L878 garLoopResultBuilder]: At program point L20-3(lines 20 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-04-15 13:04:37,741 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-04-15 13:04:37,741 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-04-15 13:04:37,741 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 12 27) the Hoare annotation is: true [2022-04-15 13:04:37,741 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2022-04-15 13:04:37,742 INFO L878 garLoopResultBuilder]: At program point L22-2(lines 22 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-04-15 13:04:37,742 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 13:04:37,742 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (<= 2 __VERIFIER_assert_~cond) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) (<= (+ 2 __VERIFIER_assert_~cond) 0)) [2022-04-15 13:04:37,742 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) [2022-04-15 13:04:37,742 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (<= 2 __VERIFIER_assert_~cond) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) (<= (+ 2 __VERIFIER_assert_~cond) 0)) [2022-04-15 13:04:37,742 INFO L878 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (<= 2 __VERIFIER_assert_~cond) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) (<= (+ 2 __VERIFIER_assert_~cond) 0)) [2022-04-15 13:04:37,742 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) [2022-04-15 13:04:37,745 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2022-04-15 13:04:37,746 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 13:04:37,749 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 13:04:37,751 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 13:04:37,794 INFO L163 areAnnotationChecker]: CFG has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 13:04:37,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:04:37 BoogieIcfgContainer [2022-04-15 13:04:37,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 13:04:37,804 INFO L158 Benchmark]: Toolchain (without parser) took 6323.64ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 146.0MB in the beginning and 167.1MB in the end (delta: -21.1MB). Peak memory consumption was 100.2MB. Max. memory is 8.0GB. [2022-04-15 13:04:37,804 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 192.9MB. Free memory is still 162.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:04:37,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.38ms. Allocated memory is still 192.9MB. Free memory was 145.8MB in the beginning and 171.1MB in the end (delta: -25.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:04:37,805 INFO L158 Benchmark]: Boogie Preprocessor took 32.01ms. Allocated memory is still 192.9MB. Free memory was 171.1MB in the beginning and 169.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 13:04:37,805 INFO L158 Benchmark]: RCFGBuilder took 289.33ms. Allocated memory is still 192.9MB. Free memory was 169.4MB in the beginning and 157.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:04:37,805 INFO L158 Benchmark]: TraceAbstraction took 5763.43ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 157.4MB in the beginning and 167.1MB in the end (delta: -9.7MB). Peak memory consumption was 112.3MB. Max. memory is 8.0GB. [2022-04-15 13:04:37,806 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 192.9MB. Free memory is still 162.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.38ms. Allocated memory is still 192.9MB. Free memory was 145.8MB in the beginning and 171.1MB in the end (delta: -25.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.01ms. Allocated memory is still 192.9MB. Free memory was 171.1MB in the beginning and 169.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 289.33ms. Allocated memory is still 192.9MB. Free memory was 169.4MB in the beginning and 157.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5763.43ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 157.4MB in the beginning and 167.1MB in the end (delta: -9.7MB). Peak memory consumption was 112.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 184 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 115 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=3, 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.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 46 PreInvPairs, 78 NumberOfFragments, 479 HoareAnnotationTreeSize, 46 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 150 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (v == 0 || ((0 <= v && aux-v++-aux == 0) && (v + 4294967295) % 4294967296 < 10)) || ((2 <= v && v / 4294967296 * 4294967296 + 10 <= v) && (v + 4294967295) % 4294967296 < 10) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (v == 0 || ((0 <= v && aux-v++-aux == 0) && (v + 4294967295) % 4294967296 < 10)) || ((2 <= v && v / 4294967296 * 4294967296 + 10 <= v) && (v + 4294967295) % 4294967296 < 10) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (v == 0 || ((0 <= v && aux-v++-aux == 0) && (v + 4294967295) % 4294967296 < 10)) || ((2 <= v && v / 4294967296 * 4294967296 + 10 <= v) && (v + 4294967295) % 4294967296 < 10) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: v == 0 || ((v == 1 || (1 <= v && (v + 4294967294) % 4294967296 < 10)) && (v + 4294967295) % 4294967296 < 10) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (v == 0 || ((0 <= v && aux-v++-aux == 0) && (v + 4294967295) % 4294967296 < 10)) || ((2 <= v && v / 4294967296 * 4294967296 + 10 <= v) && (v + 4294967295) % 4294967296 < 10) - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (2 <= cond || (!(2 <= \old(cond)) && !(2 + \old(cond) <= 0))) || 2 + cond <= 0 RESULT: Ultimate proved your program to be correct! [2022-04-15 13:04:37,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...