/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/loop-acceleration/functions_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:16:42,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:16:42,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:16:42,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:16:42,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:16:42,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:16:42,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:16:42,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:16:42,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:16:42,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:16:42,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:16:42,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:16:42,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:16:42,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:16:42,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:16:42,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:16:42,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:16:42,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:16:42,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:16:42,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:16:42,858 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:16:42,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:16:42,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:16:42,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:16:42,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:16:42,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:16:42,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:16:42,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:16:42,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:16:42,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:16:42,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:16:42,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:16:42,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:16:42,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:16:42,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:16:42,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:16:42,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:16:42,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:16:42,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:16:42,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:16:42,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:16:42,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:16:42,880 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 12:16:42,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:16:42,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:16:42,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:16:42,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:16:42,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:16:42,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:16:42,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:16:42,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:16:42,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:16:42,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:16:42,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:16:42,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:16:42,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:16:42,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:16:42,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:16:42,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:16:42,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:16:42,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:16:42,894 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:16:42,894 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:16:42,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:16:42,894 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:16:42,894 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 12:16:43,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:16:43,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:16:43,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:16:43,275 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:16:43,284 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:16:43,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-1.c [2022-04-15 12:16:43,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d161277/3c14ec7a55774c8486614515ab99676c/FLAG6d6188bb7 [2022-04-15 12:16:43,628 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:16:43,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c [2022-04-15 12:16:43,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d161277/3c14ec7a55774c8486614515ab99676c/FLAG6d6188bb7 [2022-04-15 12:16:44,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d161277/3c14ec7a55774c8486614515ab99676c [2022-04-15 12:16:44,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:16:44,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:16:44,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:16:44,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:16:44,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:16:44,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:16:44" (1/1) ... [2022-04-15 12:16:44,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6385b181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:44, skipping insertion in model container [2022-04-15 12:16:44,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:16:44" (1/1) ... [2022-04-15 12:16:44,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:16:44,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:16:44,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c[325,338] [2022-04-15 12:16:44,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:16:44,370 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:16:44,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c[325,338] [2022-04-15 12:16:44,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:16:44,404 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:16:44,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:44 WrapperNode [2022-04-15 12:16:44,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:16:44,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:16:44,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:16:44,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:16:44,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:44" (1/1) ... [2022-04-15 12:16:44,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:44" (1/1) ... [2022-04-15 12:16:44,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:44" (1/1) ... [2022-04-15 12:16:44,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:44" (1/1) ... [2022-04-15 12:16:44,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:44" (1/1) ... [2022-04-15 12:16:44,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:44" (1/1) ... [2022-04-15 12:16:44,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:44" (1/1) ... [2022-04-15 12:16:44,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:16:44,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:16:44,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:16:44,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:16:44,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:44" (1/1) ... [2022-04-15 12:16:44,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:16:44,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:44,494 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 12:16:44,519 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 12:16:44,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:16:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:16:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:16:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:16:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-04-15 12:16:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:16:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-04-15 12:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:16:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:16:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:16:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:16:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:16:44,603 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:16:44,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:16:44,715 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:16:44,720 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:16:44,720 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:16:44,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:16:44 BoogieIcfgContainer [2022-04-15 12:16:44,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:16:44,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:16:44,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:16:44,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:16:44,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:16:44" (1/3) ... [2022-04-15 12:16:44,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e494da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:16:44, skipping insertion in model container [2022-04-15 12:16:44,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:44" (2/3) ... [2022-04-15 12:16:44,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e494da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:16:44, skipping insertion in model container [2022-04-15 12:16:44,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:16:44" (3/3) ... [2022-04-15 12:16:44,728 INFO L111 eAbstractionObserver]: Analyzing ICFG functions_1-1.c [2022-04-15 12:16:44,731 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:16:44,731 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:16:44,758 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:16:44,763 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 12:16:44,763 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:16:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:16:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:16:44,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:44,779 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:44,780 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:44,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1649640916, now seen corresponding path program 1 times [2022-04-15 12:16:44,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:44,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [985364194] [2022-04-15 12:16:44,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:16:44,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1649640916, now seen corresponding path program 2 times [2022-04-15 12:16:44,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:44,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266854896] [2022-04-15 12:16:44,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:44,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:44,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:44,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-15 12:16:44,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 12:16:44,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #42#return; {26#true} is VALID [2022-04-15 12:16:44,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:44,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-15 12:16:44,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 12:16:44,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #42#return; {26#true} is VALID [2022-04-15 12:16:44,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-15 12:16:44,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~x~0 := 0; {26#true} is VALID [2022-04-15 12:16:44,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-15 12:16:44,920 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-15 12:16:44,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 12:16:44,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 12:16:44,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 12:16:44,921 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 12:16:44,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:44,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266854896] [2022-04-15 12:16:44,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266854896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:44,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:44,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:16:44,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:44,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [985364194] [2022-04-15 12:16:44,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [985364194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:44,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:44,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:16:44,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281167047] [2022-04-15 12:16:44,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:44,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 12:16:44,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:44,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:16:44,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:44,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:16:44,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:44,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:16:44,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:16:44,963 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:16:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:45,022 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-15 12:16:45,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:16:45,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 12:16:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:16:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 12:16:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:16:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 12:16:45,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-15 12:16:45,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:45,111 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:16:45,111 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:16:45,121 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 12:16:45,124 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:45,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:16:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:16:45,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:45,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:45,164 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:45,164 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:45,166 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:16:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:16:45,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:45,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:45,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-15 12:16:45,171 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-15 12:16:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:45,173 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:16:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:16:45,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:45,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:45,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:45,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 12:16:45,176 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2022-04-15 12:16:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:45,176 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 12:16:45,176 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:16:45,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 12:16:45,207 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 12:16:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:16:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:16:45,209 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:45,211 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:45,212 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:16:45,214 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:45,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1655182042, now seen corresponding path program 1 times [2022-04-15 12:16:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:45,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1648654244] [2022-04-15 12:16:45,215 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:16:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1655182042, now seen corresponding path program 2 times [2022-04-15 12:16:45,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:45,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240576117] [2022-04-15 12:16:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(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(16, 2);call #Ultimate.allocInit(12, 3); {170#true} is VALID [2022-04-15 12:16:45,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-15 12:16:45,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170#true} {170#true} #42#return; {170#true} is VALID [2022-04-15 12:16:45,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {170#true} call ULTIMATE.init(); {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:45,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(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(16, 2);call #Ultimate.allocInit(12, 3); {170#true} is VALID [2022-04-15 12:16:45,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-15 12:16:45,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170#true} {170#true} #42#return; {170#true} is VALID [2022-04-15 12:16:45,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {170#true} call #t~ret5 := main(); {170#true} is VALID [2022-04-15 12:16:45,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {170#true} ~x~0 := 0; {175#(= main_~x~0 0)} is VALID [2022-04-15 12:16:45,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {171#false} is VALID [2022-04-15 12:16:45,368 INFO L272 TraceCheckUtils]: 7: Hoare triple {171#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {171#false} is VALID [2022-04-15 12:16:45,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#false} ~cond := #in~cond; {171#false} is VALID [2022-04-15 12:16:45,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#false} assume 0 == ~cond; {171#false} is VALID [2022-04-15 12:16:45,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#false} assume !false; {171#false} is VALID [2022-04-15 12:16:45,369 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 12:16:45,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:45,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240576117] [2022-04-15 12:16:45,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240576117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:45,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:45,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:45,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:45,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1648654244] [2022-04-15 12:16:45,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1648654244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:45,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:45,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:45,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534505161] [2022-04-15 12:16:45,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:45,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-15 12:16:45,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:45,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 12:16:45,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:45,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:16:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:16:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:16:45,397 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 12:16:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:45,549 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-15 12:16:45,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:16:45,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-15 12:16:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 12:16:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:16:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 12:16:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:16:45,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-15 12:16:45,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:45,606 INFO L225 Difference]: With dead ends: 25 [2022-04-15 12:16:45,606 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:16:45,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 12:16:45,610 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:45,610 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:16:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-15 12:16:45,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:45,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:45,628 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:45,628 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:45,630 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-15 12:16:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 12:16:45,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:45,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:45,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-15 12:16:45,631 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-15 12:16:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:45,632 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-15 12:16:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 12:16:45,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:45,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:45,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:45,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 12:16:45,634 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-04-15 12:16:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:45,634 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 12:16:45,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 12:16:45,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 12:16:45,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:16:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:16:45,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:45,656 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 12:16:45,656 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:16:45,658 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:45,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1503524740, now seen corresponding path program 1 times [2022-04-15 12:16:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:45,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [78859124] [2022-04-15 12:16:45,788 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1236910030, now seen corresponding path program 1 times [2022-04-15 12:16:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:45,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093481248] [2022-04-15 12:16:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:45,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {316#(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(16, 2);call #Ultimate.allocInit(12, 3); {307#true} is VALID [2022-04-15 12:16:45,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-15 12:16:45,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {307#true} {307#true} #42#return; {307#true} is VALID [2022-04-15 12:16:45,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:45,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#(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(16, 2);call #Ultimate.allocInit(12, 3); {307#true} is VALID [2022-04-15 12:16:45,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-15 12:16:45,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #42#return; {307#true} is VALID [2022-04-15 12:16:45,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-15 12:16:45,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} ~x~0 := 0; {312#(= main_~x~0 0)} is VALID [2022-04-15 12:16:45,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#(= main_~x~0 0)} [46] L19-2-->L19-3_primed: Formula: (or (= v_main_~x~0_In_1 v_main_~x~0_Out_2) (and (= (* 2 |v_main_#t~ret4_Out_2|) 0) (= (mod (+ v_main_~x~0_Out_2 v_main_~x~0_In_1) 2) 0) (<= 0 (div (+ v_main_~x~0_In_1 (* v_main_~x~0_Out_2 (- 1))) (- 2))) (< (mod (+ v_main_~x~0_Out_2 4294967294) 4294967296) 268435455))) InVars {main_~x~0=v_main_~x~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~ret4=|v_main_#t~ret4_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_#t~ret4] {313#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-15 12:16:45,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(<= main_~x~0 (* (div main_~x~0 2) 2))} [45] L19-3_primed-->L19-3: Formula: (not (< (mod v_main_~x~0_3 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {313#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-15 12:16:45,901 INFO L272 TraceCheckUtils]: 8: Hoare triple {313#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {314#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:16:45,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {315#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:16:45,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {308#false} is VALID [2022-04-15 12:16:45,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-15 12:16:45,903 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 12:16:45,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:45,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093481248] [2022-04-15 12:16:45,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093481248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:45,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:45,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:16:46,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:46,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [78859124] [2022-04-15 12:16:46,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [78859124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:46,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:46,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:16:46,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336571704] [2022-04-15 12:16:46,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:46,226 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-15 12:16:46,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:46,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:46,250 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 12:16:46,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:16:46,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:46,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:16:46,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:16:46,252 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:46,889 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-04-15 12:16:46,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:16:46,889 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-15 12:16:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-15 12:16:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-15 12:16:46,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-15 12:16:46,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:46,930 INFO L225 Difference]: With dead ends: 31 [2022-04-15 12:16:46,931 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:16:46,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:16:46,932 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:46,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 50 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:16:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-04-15 12:16:46,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:46,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:46,964 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:46,964 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:46,965 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-15 12:16:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:16:46,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:46,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:46,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 12:16:46,966 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 12:16:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:46,968 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-15 12:16:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:16:46,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:46,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:46,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:46,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 12:16:46,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 17 [2022-04-15 12:16:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:46,970 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 12:16:46,970 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:16:46,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 12:16:47,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:16:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:16:47,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:47,018 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:47,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:16:47,019 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:47,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1270987934, now seen corresponding path program 2 times [2022-04-15 12:16:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:47,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201155854] [2022-04-15 12:16:47,093 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:47,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1296015374, now seen corresponding path program 1 times [2022-04-15 12:16:47,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:47,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165366348] [2022-04-15 12:16:47,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:47,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:47,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:47,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {510#(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(16, 2);call #Ultimate.allocInit(12, 3); {501#true} is VALID [2022-04-15 12:16:47,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#true} assume true; {501#true} is VALID [2022-04-15 12:16:47,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {501#true} {501#true} #42#return; {501#true} is VALID [2022-04-15 12:16:47,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:47,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#(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(16, 2);call #Ultimate.allocInit(12, 3); {501#true} is VALID [2022-04-15 12:16:47,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {501#true} assume true; {501#true} is VALID [2022-04-15 12:16:47,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {501#true} {501#true} #42#return; {501#true} is VALID [2022-04-15 12:16:47,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {501#true} call #t~ret5 := main(); {501#true} is VALID [2022-04-15 12:16:47,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#true} ~x~0 := 0; {506#(= main_~x~0 0)} is VALID [2022-04-15 12:16:47,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(= main_~x~0 0)} [48] L19-2-->L19-3_primed: Formula: (or (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (and (= (mod (+ v_main_~x~0_Out_4 v_main_~x~0_In_2) 2) 0) (<= 0 (div (+ (* v_main_~x~0_Out_4 (- 1)) v_main_~x~0_In_2) (- 2))) (< (mod (+ v_main_~x~0_Out_4 4294967294) 4294967296) 268435455) (= (* 2 |v_main_#t~ret4_Out_4|) 0))) InVars {main_~x~0=v_main_~x~0_In_2} OutVars{main_~x~0=v_main_~x~0_Out_4, main_#t~ret4=|v_main_#t~ret4_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_#t~ret4] {507#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-15 12:16:47,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= main_~x~0 (* (div main_~x~0 2) 2))} [47] L19-3_primed-->L19-3: Formula: (not (< (mod v_main_~x~0_3 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {507#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-15 12:16:47,194 INFO L272 TraceCheckUtils]: 8: Hoare triple {507#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {508#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:16:47,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {509#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:16:47,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {509#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {502#false} is VALID [2022-04-15 12:16:47,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-15 12:16:47,195 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 12:16:47,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:47,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165366348] [2022-04-15 12:16:47,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165366348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:47,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:47,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:16:47,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:47,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1201155854] [2022-04-15 12:16:47,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1201155854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:47,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:47,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:16:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207090104] [2022-04-15 12:16:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:47,983 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2022-04-15 12:16:47,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:47,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:48,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:48,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:16:48,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:48,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:16:48,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:16:48,020 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 17 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:49,696 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-15 12:16:49,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:16:49,696 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2022-04-15 12:16:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2022-04-15 12:16:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2022-04-15 12:16:49,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 27 transitions. [2022-04-15 12:16:49,809 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 12:16:49,809 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:16:49,809 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:16:49,810 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:16:49,811 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:49,811 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 59 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:16:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:16:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:16:49,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:49,812 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 12:16:49,812 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 12:16:49,812 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 12:16:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:49,812 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:16:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:16:49,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:49,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:49,812 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 12:16:49,812 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 12:16:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:49,813 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:16:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:16:49,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:49,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:49,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:49,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:49,813 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 12:16:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:16:49,813 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-15 12:16:49,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:49,813 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:16:49,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:49,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:16:49,814 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 12:16:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:16:49,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:49,816 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:16:49,817 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:16:49,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:16:50,512 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 12:16:50,513 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 12:16:50,513 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 12:16:50,513 INFO L878 garLoopResultBuilder]: At program point fEXIT(lines 12 14) the Hoare annotation is: (or (and (= |f_#in~z| f_~z) (= |f_#res| (+ 2 f_~z))) (and (not (= |f_#in~z| 0)) (or (not (< (mod (+ |f_#in~z| 4294967294) 4294967296) 268435455)) (not (<= 0 (div (* (- 1) |f_#in~z|) (- 2)))) (not (= (mod |f_#in~z| 2) 0)))) (not (< (mod |f_#in~z| 4294967296) 268435455))) [2022-04-15 12:16:50,513 INFO L885 garLoopResultBuilder]: At program point fENTRY(lines 12 14) the Hoare annotation is: true [2022-04-15 12:16:50,513 INFO L878 garLoopResultBuilder]: At program point fFINAL(lines 12 14) the Hoare annotation is: (or (and (= |f_#in~z| f_~z) (= |f_#res| (+ 2 f_~z))) (and (not (= |f_#in~z| 0)) (or (not (< (mod (+ |f_#in~z| 4294967294) 4294967296) 268435455)) (not (<= 0 (div (* (- 1) |f_#in~z|) (- 2)))) (not (= (mod |f_#in~z| 2) 0)))) (not (< (mod |f_#in~z| 4294967296) 268435455))) [2022-04-15 12:16:50,513 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 24) the Hoare annotation is: true [2022-04-15 12:16:50,513 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 24) the Hoare annotation is: true [2022-04-15 12:16:50,513 INFO L878 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 (< (mod main_~x~0 4294967296) 268435455)) (.cse1 (* (- 1) main_~x~0)) (.cse2 (= (mod main_~x~0 2) 0))) (or (and .cse0 (or (and (< (mod (+ 4294967292 main_~x~0) 4294967296) 268435455) (<= 0 (div (+ 2 .cse1) (- 2))) .cse2) (= main_~x~0 2))) (and .cse0 (or (= main_~x~0 0) (and (<= 0 (div .cse1 (- 2))) (= (* 2 |main_#t~ret4|) 0) (< (mod (+ main_~x~0 4294967294) 4294967296) 268435455) .cse2))))) [2022-04-15 12:16:50,513 INFO L878 garLoopResultBuilder]: At program point L20-1(line 20) the Hoare annotation is: (and (= (+ main_~x~0 2) |main_#t~ret4|) (< (mod (+ 4294967294 |main_#t~ret4|) 4294967296) 268435455) (or (= 2 |main_#t~ret4|) (and (<= 0 (div (+ 2 (* (- 1) |main_#t~ret4|)) (- 2))) (= (mod |main_#t~ret4| 2) 0) (< (mod (+ 4294967292 |main_#t~ret4|) 4294967296) 268435455)))) [2022-04-15 12:16:50,514 INFO L878 garLoopResultBuilder]: At program point L19-2(lines 19 21) the Hoare annotation is: (or (= main_~x~0 0) (and (< (mod (+ main_~x~0 4294967294) 4294967296) 268435455) (or (and (< (mod (+ 4294967292 main_~x~0) 4294967296) 268435455) (<= 0 (div (+ 2 (* (- 1) main_~x~0)) (- 2))) (= (mod main_~x~0 2) 0)) (= main_~x~0 2)))) [2022-04-15 12:16:50,514 INFO L878 garLoopResultBuilder]: At program point L19-3(lines 19 21) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967294) 4294967296) 268435455) (or (and (< (mod (+ 4294967292 main_~x~0) 4294967296) 268435455) (<= 0 (div (+ 2 (* (- 1) main_~x~0)) (- 2))) (= (mod main_~x~0 2) 0)) (= main_~x~0 2))) [2022-04-15 12:16:50,514 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 24) the Hoare annotation is: true [2022-04-15 12:16:50,514 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:16:50,514 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 12:16:50,514 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:16:50,514 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:16:50,514 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:16:50,514 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:16:50,514 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:16:50,514 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 12:16:50,514 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-15 12:16:50,514 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:16:50,514 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:16:50,514 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-15 12:16:50,515 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:16:50,517 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2022-04-15 12:16:50,518 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:16:50,520 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:16:50,522 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:16:50,544 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:16:50,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:16:50 BoogieIcfgContainer [2022-04-15 12:16:50,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:16:50,555 INFO L158 Benchmark]: Toolchain (without parser) took 6471.28ms. Allocated memory was 189.8MB in the beginning and 307.2MB in the end (delta: 117.4MB). Free memory was 135.1MB in the beginning and 176.7MB in the end (delta: -41.6MB). Peak memory consumption was 75.7MB. Max. memory is 8.0GB. [2022-04-15 12:16:50,555 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 189.8MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:16:50,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.47ms. Allocated memory was 189.8MB in the beginning and 307.2MB in the end (delta: 117.4MB). Free memory was 134.8MB in the beginning and 279.1MB in the end (delta: -144.3MB). Peak memory consumption was 4.9MB. Max. memory is 8.0GB. [2022-04-15 12:16:50,555 INFO L158 Benchmark]: Boogie Preprocessor took 47.48ms. Allocated memory is still 307.2MB. Free memory was 279.1MB in the beginning and 277.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:16:50,556 INFO L158 Benchmark]: RCFGBuilder took 266.73ms. Allocated memory is still 307.2MB. Free memory was 277.6MB in the beginning and 267.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 12:16:50,556 INFO L158 Benchmark]: TraceAbstraction took 5830.72ms. Allocated memory is still 307.2MB. Free memory was 267.3MB in the beginning and 176.7MB in the end (delta: 90.6MB). Peak memory consumption was 92.0MB. Max. memory is 8.0GB. [2022-04-15 12:16:50,557 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.22ms. Allocated memory is still 189.8MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 313.47ms. Allocated memory was 189.8MB in the beginning and 307.2MB in the end (delta: 117.4MB). Free memory was 134.8MB in the beginning and 279.1MB in the end (delta: -144.3MB). Peak memory consumption was 4.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.48ms. Allocated memory is still 307.2MB. Free memory was 279.1MB in the beginning and 277.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 266.73ms. Allocated memory is still 307.2MB. Free memory was 277.6MB in the beginning and 267.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5830.72ms. Allocated memory is still 307.2MB. Free memory was 267.3MB in the beginning and 176.7MB in the end (delta: 90.6MB). Peak memory consumption was 92.0MB. 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 6 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 297 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 61 mSDtfsCounter, 297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=3, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 47 PreInvPairs, 65 NumberOfFragments, 301 HoareAnnotationTreeSize, 47 FomulaSimplifications, 33 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 574 FormulaSimplificationTreeSizeReductionInter, 0.6s 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: 19]: Loop Invariant Derived loop invariant: x == 0 || ((x + 4294967294) % 4294967296 < 268435455 && ((((4294967292 + x) % 4294967296 < 268435455 && 0 <= (2 + -1 * x) / -2) && x % 2 == 0) || x == 2)) - ProcedureContractResult [Line: 12]: Procedure Contract for f Derived contract for procedure f: ((\old(z) == z && \result == 2 + z) || (!(\old(z) == 0) && ((!((\old(z) + 4294967294) % 4294967296 < 268435455) || !(0 <= -1 * \old(z) / -2)) || !(\old(z) % 2 == 0)))) || !(\old(z) % 4294967296 < 268435455) - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 12:16:50,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...