/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:47:39,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:47:39,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:47:40,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:47:40,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:47:40,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:47:40,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:47:40,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:47:40,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:47:40,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:47:40,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:47:40,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:47:40,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:47:40,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:47:40,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:47:40,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:47:40,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:47:40,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:47:40,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:47:40,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:47:40,028 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:47:40,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:47:40,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:47:40,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:47:40,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:47:40,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:47:40,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:47:40,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:47:40,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:47:40,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:47:40,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:47:40,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:47:40,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:47:40,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:47:40,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:47:40,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:47:40,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:47:40,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:47:40,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:47:40,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:47:40,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:47:40,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:47:40,042 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:47:40,051 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:47:40,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:47:40,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:47:40,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:47:40,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:47:40,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:47:40,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:47:40,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:47:40,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:47:40,053 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:47:40,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:47:40,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:47:40,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:47:40,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:47:40,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:47:40,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:47:40,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:47:40,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:47:40,054 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:47:40,054 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:47:40,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:47:40,054 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:47:40,054 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:47:40,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:47:40,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:47:40,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:47:40,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:47:40,250 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:47:40,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-15 12:47:40,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2527198c2/38858e1eaa4945799b2ba531aeca7a8a/FLAG78e5c3ecc [2022-04-15 12:47:40,666 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:47:40,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-15 12:47:40,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2527198c2/38858e1eaa4945799b2ba531aeca7a8a/FLAG78e5c3ecc [2022-04-15 12:47:40,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2527198c2/38858e1eaa4945799b2ba531aeca7a8a [2022-04-15 12:47:40,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:47:40,684 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:47:40,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:47:40,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:47:40,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:47:40,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:47:40" (1/1) ... [2022-04-15 12:47:40,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e40254a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:40, skipping insertion in model container [2022-04-15 12:47:40,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:47:40" (1/1) ... [2022-04-15 12:47:40,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:47:40,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:47:40,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c[368,381] [2022-04-15 12:47:40,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:47:40,826 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:47:40,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c[368,381] [2022-04-15 12:47:40,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:47:40,844 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:47:40,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:40 WrapperNode [2022-04-15 12:47:40,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:47:40,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:47:40,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:47:40,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:47:40,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:40" (1/1) ... [2022-04-15 12:47:40,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:40" (1/1) ... [2022-04-15 12:47:40,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:40" (1/1) ... [2022-04-15 12:47:40,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:40" (1/1) ... [2022-04-15 12:47:40,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:40" (1/1) ... [2022-04-15 12:47:40,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:40" (1/1) ... [2022-04-15 12:47:40,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:40" (1/1) ... [2022-04-15 12:47:40,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:47:40,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:47:40,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:47:40,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:47:40,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:40" (1/1) ... [2022-04-15 12:47:40,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:47:40,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:40,936 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:47:40,954 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:47:40,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:47:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:47:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:47:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:47:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:47:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:47:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:47:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:47:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:47:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:47:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:47:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:47:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:47:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:47:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:47:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:47:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:47:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:47:41,021 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:47:41,025 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:47:41,116 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:47:41,121 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:47:41,121 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:47:41,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:47:41 BoogieIcfgContainer [2022-04-15 12:47:41,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:47:41,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:47:41,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:47:41,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:47:41,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:47:40" (1/3) ... [2022-04-15 12:47:41,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdba626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:47:41, skipping insertion in model container [2022-04-15 12:47:41,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:40" (2/3) ... [2022-04-15 12:47:41,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdba626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:47:41, skipping insertion in model container [2022-04-15 12:47:41,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:47:41" (3/3) ... [2022-04-15 12:47:41,134 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de20.c [2022-04-15 12:47:41,137 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:47:41,137 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:47:41,164 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:47:41,168 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:47:41,169 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:47:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:47:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:47:41,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:41,186 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:41,186 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 1 times [2022-04-15 12:47:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:41,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2048118188] [2022-04-15 12:47:41,201 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:47:41,203 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 2 times [2022-04-15 12:47:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:41,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007364228] [2022-04-15 12:47:41,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:41,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:41,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:41,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(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(10, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 12:47:41,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 12:47:41,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-15 12:47:41,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:41,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(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(10, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 12:47:41,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 12:47:41,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-15 12:47:41,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret9 := main(); {24#true} is VALID [2022-04-15 12:47:41,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:47:41,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:47:41,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:47:41,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:47:41,479 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:47:41,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:41,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-15 12:47:41,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 12:47:41,480 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:47:41,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:41,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007364228] [2022-04-15 12:47:41,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007364228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:41,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:41,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:47:41,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:41,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2048118188] [2022-04-15 12:47:41,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2048118188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:41,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:41,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:47:41,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710574810] [2022-04-15 12:47:41,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:41,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-15 12:47:41,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:41,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:47:41,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:41,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:47:41,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:47:41,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:47:41,532 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:47:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:41,812 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-15 12:47:41,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:47:41,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-15 12:47:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:47:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-15 12:47:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:47:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-15 12:47:41,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-15 12:47:41,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:41,888 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:47:41,888 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:47:41,891 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:47:41,896 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:41,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:47:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:47:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:47:41,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:41,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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:47:41,936 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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:47:41,936 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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:47:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:41,938 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:47:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:47:41,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:41,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:41,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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) Second operand 17 states. [2022-04-15 12:47:41,939 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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) Second operand 17 states. [2022-04-15 12:47:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:41,941 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:47:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:47:41,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:41,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:41,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:41,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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:47:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 12:47:41,943 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-15 12:47:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:41,945 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 12:47:41,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:47:41,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 12:47:41,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:47:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:47:41,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:41,966 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:41,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:47:41,971 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:41,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1071583787, now seen corresponding path program 1 times [2022-04-15 12:47:41,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:41,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1640571573] [2022-04-15 12:47:42,158 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1959087468, now seen corresponding path program 1 times [2022-04-15 12:47:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:42,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630861754] [2022-04-15 12:47:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:42,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#(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(10, 2);call #Ultimate.allocInit(12, 3); {203#true} is VALID [2022-04-15 12:47:42,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-15 12:47:42,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #50#return; {203#true} is VALID [2022-04-15 12:47:42,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:42,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#(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(10, 2);call #Ultimate.allocInit(12, 3); {203#true} is VALID [2022-04-15 12:47:42,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-15 12:47:42,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #50#return; {203#true} is VALID [2022-04-15 12:47:42,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret9 := main(); {203#true} is VALID [2022-04-15 12:47:42,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {208#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:47:42,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {209#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:47:42,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {209#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {210#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:47:42,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {210#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [54] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~z~0_In_1 v_main_~z~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post8_Out_2| 0) (= (+ v_main_~x~0_Out_2 v_main_~z~0_Out_2) (+ v_main_~z~0_In_1 v_main_~x~0_In_1)) (< 0 (mod (+ v_main_~z~0_Out_2 1) 4294967296)) (= |v_main_#t~post7_Out_2| 0))) InVars {main_~x~0=v_main_~x~0_In_1, main_~z~0=v_main_~z~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post8=|v_main_#t~post8_Out_2|, main_~z~0=v_main_~z~0_Out_2, main_#t~post7=|v_main_#t~post7_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {211#(and (or (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ (div (+ main_~z~0 1) 4294967296) (div main_~x~0 4294967296) 1) (div main_~n~0 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:47:42,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#(and (or (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ (div (+ main_~z~0 1) 4294967296) (div main_~x~0 4294967296) 1) (div main_~n~0 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [53] L23-3_primed-->L23-3: Formula: (not (< 0 (mod v_main_~z~0_2 4294967296))) InVars {main_~z~0=v_main_~z~0_2} OutVars{main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[] {212#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:47:42,563 INFO L272 TraceCheckUtils]: 10: Hoare triple {212#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {213#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:47:42,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {214#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:42,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {214#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {204#false} is VALID [2022-04-15 12:47:42,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-15 12:47:42,564 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:47:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:42,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630861754] [2022-04-15 12:47:42,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630861754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:42,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:42,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:47:42,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1640571573] [2022-04-15 12:47:42,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1640571573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:42,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:42,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:47:42,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607648030] [2022-04-15 12:47:42,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:42,703 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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 14 [2022-04-15 12:47:42,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:42,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:47:42,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:42,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:47:42,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:42,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:47:42,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:47:42,719 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:47:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:42,936 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:47:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:47:42,936 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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 14 [2022-04-15 12:47:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:47:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-04-15 12:47:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:47:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-04-15 12:47:42,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2022-04-15 12:47:42,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:42,967 INFO L225 Difference]: With dead ends: 23 [2022-04-15 12:47:42,967 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:47:42,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:47:42,968 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:42,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 44 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:47:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:47:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:47:42,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:42,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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:47:42,971 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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:47:42,971 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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:47:42,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:42,972 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:47:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:47:42,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:42,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:42,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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) Second operand 15 states. [2022-04-15 12:47:42,973 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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) Second operand 15 states. [2022-04-15 12:47:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:42,974 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:47:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:47:42,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:42,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:42,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:42,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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:47:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 12:47:42,976 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2022-04-15 12:47:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:42,976 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 12:47:42,977 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:47:42,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 12:47:42,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:47:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:47:42,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:42,994 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:42,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:47:42,995 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:42,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1025479988, now seen corresponding path program 1 times [2022-04-15 12:47:42,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:42,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1494322336] [2022-04-15 12:47:45,577 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2032929875, now seen corresponding path program 1 times [2022-04-15 12:47:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:45,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098238684] [2022-04-15 12:47:45,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:45,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:45,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:45,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(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(10, 2);call #Ultimate.allocInit(12, 3); {332#true} is VALID [2022-04-15 12:47:45,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#true} assume true; {332#true} is VALID [2022-04-15 12:47:45,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {332#true} {332#true} #50#return; {332#true} is VALID [2022-04-15 12:47:45,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:45,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#(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(10, 2);call #Ultimate.allocInit(12, 3); {332#true} is VALID [2022-04-15 12:47:45,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#true} assume true; {332#true} is VALID [2022-04-15 12:47:45,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {332#true} {332#true} #50#return; {332#true} is VALID [2022-04-15 12:47:45,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {332#true} call #t~ret9 := main(); {332#true} is VALID [2022-04-15 12:47:45,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {337#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:47:45,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [56] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~y~0_In_1 v_main_~y~0_Out_2)) (and (= 0 |v_main_#t~post6_Out_2|) (<= v_main_~x~0_Out_4 v_main_~x~0_In_2) (< 0 (mod (+ v_main_~x~0_Out_4 1) 4294967296)) (= |v_main_#t~post5_Out_2| 0) (= (+ v_main_~x~0_Out_4 v_main_~y~0_Out_2) (+ v_main_~x~0_In_2 v_main_~y~0_In_1)))) InVars {main_~x~0=v_main_~x~0_In_2, main_~y~0=v_main_~y~0_In_1} OutVars{main_~y~0=v_main_~y~0_Out_2, main_#t~post5=|v_main_#t~post5_Out_2|, main_~x~0=v_main_~x~0_Out_4, main_#t~post6=|v_main_#t~post6_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {338#(or (= main_~n~0 main_~x~0) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))))) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:47:45,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {338#(or (= main_~n~0 main_~x~0) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))))) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))))} [55] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {339#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (or (= main_~n~0 main_~x~0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))))))} is VALID [2022-04-15 12:47:45,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {339#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (or (= main_~n~0 main_~x~0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))))))} ~z~0 := ~y~0; {340#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~z~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~z~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))))))} is VALID [2022-04-15 12:47:45,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~z~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~z~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))))))} assume !(~z~0 % 4294967296 > 0); {341#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:47:45,886 INFO L272 TraceCheckUtils]: 10: Hoare triple {341#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {342#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:47:45,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {342#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {343#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:45,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {333#false} is VALID [2022-04-15 12:47:45,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {333#false} assume !false; {333#false} is VALID [2022-04-15 12:47:45,887 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:47:45,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:45,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098238684] [2022-04-15 12:47:45,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098238684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:45,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:45,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:47:45,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:45,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1494322336] [2022-04-15 12:47:45,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1494322336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:45,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:45,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:47:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042765221] [2022-04-15 12:47:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:45,973 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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 14 [2022-04-15 12:47:45,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:45,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:47:45,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:45,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:47:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:45,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:47:45,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:47:45,988 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:47:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:46,697 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-15 12:47:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:47:46,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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 14 [2022-04-15 12:47:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:46,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:47:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-15 12:47:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:47:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-15 12:47:46,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 22 transitions. [2022-04-15 12:47:46,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:46,750 INFO L225 Difference]: With dead ends: 21 [2022-04-15 12:47:46,751 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 12:47:46,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:47:46,752 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:46,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 46 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:47:46,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 12:47:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 12:47:46,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:46,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 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:47:46,770 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 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:47:46,770 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 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:47:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:46,773 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 12:47:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 12:47:46,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:46,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:46,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 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) Second operand 16 states. [2022-04-15 12:47:46,774 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 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) Second operand 16 states. [2022-04-15 12:47:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:46,777 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 12:47:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 12:47:46,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:46,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:46,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:46,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 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:47:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 12:47:46,780 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-15 12:47:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:46,780 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 12:47:46,780 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:47:46,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 12:47:46,839 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:47:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 12:47:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:47:46,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:46,840 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:46,840 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:47:46,840 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:46,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:46,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1690613482, now seen corresponding path program 1 times [2022-04-15 12:47:46,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:46,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [463141205] [2022-04-15 12:47:46,967 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:46,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1308890133, now seen corresponding path program 1 times [2022-04-15 12:47:46,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:46,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553499541] [2022-04-15 12:47:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:46,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:47,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:47,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {480#(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(10, 2);call #Ultimate.allocInit(12, 3); {467#true} is VALID [2022-04-15 12:47:47,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {467#true} assume true; {467#true} is VALID [2022-04-15 12:47:47,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {467#true} {467#true} #50#return; {467#true} is VALID [2022-04-15 12:47:47,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {480#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:47,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#(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(10, 2);call #Ultimate.allocInit(12, 3); {467#true} is VALID [2022-04-15 12:47:47,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2022-04-15 12:47:47,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #50#return; {467#true} is VALID [2022-04-15 12:47:47,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret9 := main(); {467#true} is VALID [2022-04-15 12:47:47,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {472#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:47:47,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {472#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [58] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_Out_6 v_main_~y~0_Out_4) (+ v_main_~x~0_In_3 v_main_~y~0_In_2)) (= |v_main_#t~post5_Out_4| 0) (<= v_main_~x~0_Out_6 v_main_~x~0_In_3) (= 0 |v_main_#t~post6_Out_4|) (< 0 (mod (+ v_main_~x~0_Out_6 1) 4294967296))) (and (= v_main_~x~0_In_3 v_main_~x~0_Out_6) (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) InVars {main_~x~0=v_main_~x~0_In_3, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_6, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {473#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-15 12:47:47,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {473#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [57] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {474#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:47:47,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {475#(or (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (< (div main_~n~0 4294967296) (+ (div main_~z~0 4294967296) (div (+ main_~x~0 1) 4294967296) 1))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-15 12:47:47,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#(or (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (< (div main_~n~0 4294967296) (+ (div main_~z~0 4294967296) (div (+ main_~x~0 1) 4294967296) 1))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {476#(and (or (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~n~0 4294967295 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:47:47,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {476#(and (or (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~n~0 4294967295 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {477#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:47:47,297 INFO L272 TraceCheckUtils]: 11: Hoare triple {477#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:47:47,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {478#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {479#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:47,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {479#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {468#false} is VALID [2022-04-15 12:47:47,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {468#false} assume !false; {468#false} is VALID [2022-04-15 12:47:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:47,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:47,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553499541] [2022-04-15 12:47:47,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553499541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:47,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353012155] [2022-04-15 12:47:47,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:47,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:47,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:47,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:47,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:47:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:47,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:47:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:47,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:58,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2022-04-15 12:47:58,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {467#true} #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(10, 2);call #Ultimate.allocInit(12, 3); {467#true} is VALID [2022-04-15 12:47:58,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2022-04-15 12:47:58,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #50#return; {467#true} is VALID [2022-04-15 12:47:58,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret9 := main(); {467#true} is VALID [2022-04-15 12:47:58,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {472#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:47:58,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {472#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [58] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_Out_6 v_main_~y~0_Out_4) (+ v_main_~x~0_In_3 v_main_~y~0_In_2)) (= |v_main_#t~post5_Out_4| 0) (<= v_main_~x~0_Out_6 v_main_~x~0_In_3) (= 0 |v_main_#t~post6_Out_4|) (< 0 (mod (+ v_main_~x~0_Out_6 1) 4294967296))) (and (= v_main_~x~0_In_3 v_main_~x~0_Out_6) (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) InVars {main_~x~0=v_main_~x~0_In_3, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_6, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {502#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:47:58,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {502#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [57] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {506#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:47:58,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {506#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} ~z~0 := ~y~0; {510#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~z~0 main_~x~0)))} is VALID [2022-04-15 12:47:58,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~z~0 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {514#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:47:58,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {514#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)) (<= main_~x~0 (+ main_~n~0 1)))} assume !(~z~0 % 4294967296 > 0); {518#(and (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:47:58,598 INFO L272 TraceCheckUtils]: 11: Hoare triple {518#(and (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {522#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:47:58,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {522#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {526#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:47:58,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {526#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {468#false} is VALID [2022-04-15 12:47:58,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {468#false} assume !false; {468#false} is VALID [2022-04-15 12:47:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:58,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:01,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {468#false} assume !false; {468#false} is VALID [2022-04-15 12:48:01,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {526#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {468#false} is VALID [2022-04-15 12:48:01,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {522#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {526#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:48:01,176 INFO L272 TraceCheckUtils]: 11: Hoare triple {477#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {522#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:01,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {545#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {477#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:48:01,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {549#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {545#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:48:01,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {553#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} ~z~0 := ~y~0; {549#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:48:01,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {557#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} [57] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {553#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:48:01,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {561#(and (or (< (div (+ (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296))) (<= (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 main_~x~0 4294967294) 4294967296) 1))) (<= (+ (div (+ main_~n~0 (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ (div (+ main_~y~0 main_~x~0 4294967294) 4294967296) 1)))} [58] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_Out_6 v_main_~y~0_Out_4) (+ v_main_~x~0_In_3 v_main_~y~0_In_2)) (= |v_main_#t~post5_Out_4| 0) (<= v_main_~x~0_Out_6 v_main_~x~0_In_3) (= 0 |v_main_#t~post6_Out_4|) (< 0 (mod (+ v_main_~x~0_Out_6 1) 4294967296))) (and (= v_main_~x~0_In_3 v_main_~x~0_Out_6) (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) InVars {main_~x~0=v_main_~x~0_In_3, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_6, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {557#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:48:01,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {561#(and (or (< (div (+ (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296))) (<= (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 main_~x~0 4294967294) 4294967296) 1))) (<= (+ (div (+ main_~n~0 (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ (div (+ main_~y~0 main_~x~0 4294967294) 4294967296) 1)))} is VALID [2022-04-15 12:48:01,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret9 := main(); {467#true} is VALID [2022-04-15 12:48:01,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #50#return; {467#true} is VALID [2022-04-15 12:48:01,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2022-04-15 12:48:01,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {467#true} #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(10, 2);call #Ultimate.allocInit(12, 3); {467#true} is VALID [2022-04-15 12:48:01,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2022-04-15 12:48:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:01,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353012155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:01,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:01,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-15 12:48:01,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:01,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [463141205] [2022-04-15 12:48:01,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [463141205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:01,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:01,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:48:01,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132708893] [2022-04-15 12:48:01,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:01,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:48:01,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:01,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:01,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:01,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:48:01,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:01,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:48:01,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:48:01,402 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:02,187 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:48:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:48:02,188 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:48:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-15 12:48:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-15 12:48:02,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 26 transitions. [2022-04-15 12:48:02,256 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:48:02,257 INFO L225 Difference]: With dead ends: 24 [2022-04-15 12:48:02,257 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:48:02,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:48:02,258 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:02,259 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 51 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:48:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:48:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:48:02,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:02,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 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:48:02,295 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 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:48:02,295 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 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:48:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:02,296 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-15 12:48:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 12:48:02,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:02,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:02,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 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) Second operand 18 states. [2022-04-15 12:48:02,296 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 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) Second operand 18 states. [2022-04-15 12:48:02,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:02,297 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-15 12:48:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 12:48:02,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:02,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:02,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:02,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 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:48:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-15 12:48:02,299 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2022-04-15 12:48:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:02,299 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-15 12:48:02,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:02,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-15 12:48:02,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 12:48:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:48:02,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:02,352 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:02,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:02,552 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:02,552 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:02,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:02,553 INFO L85 PathProgramCache]: Analyzing trace with hash -78075946, now seen corresponding path program 2 times [2022-04-15 12:48:02,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:02,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090020117] [2022-04-15 12:48:02,691 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:02,692 INFO L85 PathProgramCache]: Analyzing trace with hash 829880021, now seen corresponding path program 1 times [2022-04-15 12:48:02,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:02,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465545225] [2022-04-15 12:48:02,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:02,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:03,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {738#(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(10, 2);call #Ultimate.allocInit(12, 3); {724#true} is VALID [2022-04-15 12:48:03,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-15 12:48:03,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {724#true} {724#true} #50#return; {724#true} is VALID [2022-04-15 12:48:03,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:03,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#(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(10, 2);call #Ultimate.allocInit(12, 3); {724#true} is VALID [2022-04-15 12:48:03,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-15 12:48:03,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #50#return; {724#true} is VALID [2022-04-15 12:48:03,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret9 := main(); {724#true} is VALID [2022-04-15 12:48:03,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {729#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:48:03,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {729#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [60] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_4 v_main_~x~0_Out_8)) (and (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (= (+ v_main_~x~0_In_4 v_main_~y~0_In_3) (+ v_main_~x~0_Out_8 v_main_~y~0_Out_6)) (= |v_main_#t~post5_Out_6| 0) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= 0 |v_main_#t~post6_Out_6|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {730#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:48:03,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [59] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {730#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:48:03,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {730#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} ~z~0 := ~y~0; {731#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0)))} is VALID [2022-04-15 12:48:03,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {732#(or (and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1))) (and (<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~z~0 main_~x~0) main_~n~0)))} is VALID [2022-04-15 12:48:03,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {732#(or (and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1))) (and (<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~z~0 main_~x~0) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {733#(or (and (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967293)) (<= (+ main_~z~0 main_~x~0) main_~n~0)) (and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2))))} is VALID [2022-04-15 12:48:03,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#(or (and (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967293)) (<= (+ main_~z~0 main_~x~0) main_~n~0)) (and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {734#(or (and (<= (+ (div main_~z~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (or (<= main_~n~0 (+ main_~z~0 main_~x~0)) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))) (and (<= 0 (+ main_~z~0 3)) (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) 4294967296 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:48:03,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {734#(or (and (<= (+ (div main_~z~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (or (<= main_~n~0 (+ main_~z~0 main_~x~0)) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))) (and (<= 0 (+ main_~z~0 3)) (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) 4294967296 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {735#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:48:03,041 INFO L272 TraceCheckUtils]: 13: Hoare triple {735#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:48:03,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {736#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {737#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:48:03,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {725#false} is VALID [2022-04-15 12:48:03,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {725#false} assume !false; {725#false} is VALID [2022-04-15 12:48:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:03,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:03,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465545225] [2022-04-15 12:48:03,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465545225] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:03,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985284908] [2022-04-15 12:48:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:03,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:03,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:03,044 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:03,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:48:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:03,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:48:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:03,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:21,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {724#true} is VALID [2022-04-15 12:48:21,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#true} #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(10, 2);call #Ultimate.allocInit(12, 3); {724#true} is VALID [2022-04-15 12:48:21,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-15 12:48:21,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #50#return; {724#true} is VALID [2022-04-15 12:48:21,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret9 := main(); {724#true} is VALID [2022-04-15 12:48:21,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {729#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:48:21,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {729#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [60] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_4 v_main_~x~0_Out_8)) (and (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (= (+ v_main_~x~0_In_4 v_main_~y~0_In_3) (+ v_main_~x~0_Out_8 v_main_~y~0_Out_6)) (= |v_main_#t~post5_Out_6| 0) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= 0 |v_main_#t~post6_Out_6|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {760#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:48:21,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [59] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {764#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:48:21,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} ~z~0 := ~y~0; {768#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~z~0 main_~x~0)))} is VALID [2022-04-15 12:48:21,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {768#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~z~0 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {772#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~n~0 (+ main_~z~0 main_~x~0)) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:48:21,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {772#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~n~0 (+ main_~z~0 main_~x~0)) (<= main_~x~0 (+ main_~n~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {776#(and (<= 0 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} is VALID [2022-04-15 12:48:21,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {776#(and (<= 0 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {780#(and (<= 0 (+ main_~z~0 3)) (not (< 0 (mod (+ main_~n~0 4294967293 (* main_~z~0 4294967295)) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} is VALID [2022-04-15 12:48:21,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {780#(and (<= 0 (+ main_~z~0 3)) (not (< 0 (mod (+ main_~n~0 4294967293 (* main_~z~0 4294967295)) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {784#(and (<= main_~x~0 (+ main_~n~0 3)) (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))))} is VALID [2022-04-15 12:48:21,516 INFO L272 TraceCheckUtils]: 13: Hoare triple {784#(and (<= main_~x~0 (+ main_~n~0 3)) (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {788#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:21,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {792#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:48:21,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {792#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {725#false} is VALID [2022-04-15 12:48:21,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {725#false} assume !false; {725#false} is VALID [2022-04-15 12:48:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:21,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:25,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {725#false} assume !false; {725#false} is VALID [2022-04-15 12:48:25,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {792#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {725#false} is VALID [2022-04-15 12:48:25,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {792#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:48:25,534 INFO L272 TraceCheckUtils]: 13: Hoare triple {735#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {788#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:25,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {811#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {735#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:48:25,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {815#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {811#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:48:25,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {819#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {815#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:48:25,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {823#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {819#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 12:48:25,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {827#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} ~z~0 := ~y~0; {823#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:48:25,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} [59] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {827#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:48:25,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {835#(and (or (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2)) (<= (+ (div main_~n~0 4294967296) (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~n~0 (- 3)) (- 4294967296))) (+ 2 (div (+ main_~y~0 main_~x~0) 4294967296)))) (or (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2)) (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296)))))} [60] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_4 v_main_~x~0_Out_8)) (and (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (= (+ v_main_~x~0_In_4 v_main_~y~0_In_3) (+ v_main_~x~0_Out_8 v_main_~y~0_Out_6)) (= |v_main_#t~post5_Out_6| 0) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= 0 |v_main_#t~post6_Out_6|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {831#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:48:25,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {835#(and (or (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2)) (<= (+ (div main_~n~0 4294967296) (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~n~0 (- 3)) (- 4294967296))) (+ 2 (div (+ main_~y~0 main_~x~0) 4294967296)))) (or (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2)) (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296)))))} is VALID [2022-04-15 12:48:25,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret9 := main(); {724#true} is VALID [2022-04-15 12:48:25,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #50#return; {724#true} is VALID [2022-04-15 12:48:25,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-15 12:48:25,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#true} #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(10, 2);call #Ultimate.allocInit(12, 3); {724#true} is VALID [2022-04-15 12:48:25,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {724#true} is VALID [2022-04-15 12:48:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:25,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985284908] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:25,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:25,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-04-15 12:48:25,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:25,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090020117] [2022-04-15 12:48:25,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090020117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:25,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:25,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:48:25,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486773590] [2022-04-15 12:48:25,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:25,687 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:48:25,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:25,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:25,733 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:48:25,733 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:48:25,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:25,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:48:25,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:48:25,734 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:26,573 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-15 12:48:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:48:26,573 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:48:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2022-04-15 12:48:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2022-04-15 12:48:26,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 18 transitions. [2022-04-15 12:48:26,613 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:48:26,614 INFO L225 Difference]: With dead ends: 18 [2022-04-15 12:48:26,614 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:48:26,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:48:26,615 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:26,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 39 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:48:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:48:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:48:26,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:26,615 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:48:26,616 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:48:26,616 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:48:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:26,616 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:48:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:48:26,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:26,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:26,616 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:48:26,616 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:48:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:26,616 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:48:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:48:26,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:26,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:26,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:26,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:26,617 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:48:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:48:26,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-15 12:48:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:26,617 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:48:26,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:48:26,617 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:48:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:48:26,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:26,619 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:48:26,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:26,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:26,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:48:27,329 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 12:48:27,329 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 12:48:27,330 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 12:48:27,330 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-15 12:48:27,330 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 12 31) the Hoare annotation is: true [2022-04-15 12:48:27,330 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse9 (+ main_~x~0 1))) (let ((.cse8 (div main_~n~0 4294967296)) (.cse5 (div .cse9 4294967296)) (.cse11 (+ main_~z~0 main_~x~0)) (.cse10 (div main_~z~0 4294967296))) (let ((.cse3 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* .cse10 4294967296) (* (- 1) main_~n~0)) 4294967296))) (.cse0 (<= main_~n~0 .cse11)) (.cse1 (<= .cse11 main_~n~0)) (.cse6 (< .cse8 (+ .cse10 .cse5 1)))) (or (and .cse0 .cse1 (or (let ((.cse2 (+ main_~z~0 2))) (and (<= .cse2 0) (<= 0 .cse2))) (<= main_~z~0 (+ .cse3 4294967293)))) (and (or (let ((.cse4 (+ main_~z~0 1))) (and (<= .cse4 0) (<= 0 .cse4))) (<= main_~z~0 (+ 4294967294 .cse3))) (<= (* .cse5 4294967296) main_~x~0) .cse1 .cse6) (let ((.cse7 (* 4294967296 (div main_~x~0 4294967296)))) (and (or .cse0 (< (+ main_~n~0 .cse7) (+ main_~x~0 (* .cse8 4294967296) 1))) (<= .cse9 main_~n~0) (<= main_~n~0 (+ main_~y~0 .cse7)) (or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and .cse1 .cse6)) (= main_~n~0 (+ main_~y~0 main_~x~0)))))))) [2022-04-15 12:48:27,330 INFO L878 garLoopResultBuilder]: At program point L23-3(lines 23 27) the Hoare annotation is: (let ((.cse1 (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (.cse0 (* (div main_~n~0 4294967296) 4294967296))) (and (<= (+ main_~x~0 .cse0) .cse1) (< .cse1 (+ main_~x~0 .cse0 1)))) [2022-04-15 12:48:27,330 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 12 31) the Hoare annotation is: true [2022-04-15 12:48:27,330 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 12 31) the Hoare annotation is: true [2022-04-15 12:48:27,330 INFO L878 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: (or (let ((.cse0 (+ main_~x~0 1))) (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (mod .cse0 4294967296)) (or (and (= .cse0 main_~n~0) (= main_~y~0 1)) (and (<= .cse0 main_~n~0) (< 0 (mod (+ main_~x~0 2) 4294967296)) (= main_~n~0 (+ main_~y~0 main_~x~0)))))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) [2022-04-15 12:48:27,330 INFO L878 garLoopResultBuilder]: At program point L16-3(lines 16 20) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~x~0 4294967296)))) (or (and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~y~0 .cse0)) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (<= main_~x~0 .cse0) (= main_~y~0 0)))) [2022-04-15 12:48:27,330 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:48:27,330 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:48:27,330 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:48:27,331 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:48:27,331 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:48:27,331 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:48:27,331 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:48:27,331 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 12:48:27,331 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:48:27,331 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:48:27,331 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:48:27,331 INFO L878 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:48:27,331 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:48:27,333 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:27,334 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:48:27,336 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:48:27,338 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:48:27,409 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:48:27,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:48:27 BoogieIcfgContainer [2022-04-15 12:48:27,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:48:27,421 INFO L158 Benchmark]: Toolchain (without parser) took 46737.60ms. Allocated memory was 174.1MB in the beginning and 217.1MB in the end (delta: 43.0MB). Free memory was 124.5MB in the beginning and 144.6MB in the end (delta: -20.1MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. [2022-04-15 12:48:27,422 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 174.1MB. Free memory was 140.7MB in the beginning and 140.7MB in the end (delta: 71.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:48:27,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.27ms. Allocated memory is still 174.1MB. Free memory was 124.3MB in the beginning and 150.3MB in the end (delta: -26.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:48:27,422 INFO L158 Benchmark]: Boogie Preprocessor took 31.52ms. Allocated memory is still 174.1MB. Free memory was 150.3MB in the beginning and 149.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:48:27,422 INFO L158 Benchmark]: RCFGBuilder took 243.18ms. Allocated memory is still 174.1MB. Free memory was 149.0MB in the beginning and 138.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 12:48:27,422 INFO L158 Benchmark]: TraceAbstraction took 46296.75ms. Allocated memory was 174.1MB in the beginning and 217.1MB in the end (delta: 43.0MB). Free memory was 137.8MB in the beginning and 144.6MB in the end (delta: -6.9MB). Peak memory consumption was 36.4MB. Max. memory is 8.0GB. [2022-04-15 12:48:27,423 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.17ms. Allocated memory is still 174.1MB. Free memory was 140.7MB in the beginning and 140.7MB in the end (delta: 71.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 153.27ms. Allocated memory is still 174.1MB. Free memory was 124.3MB in the beginning and 150.3MB in the end (delta: -26.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.52ms. Allocated memory is still 174.1MB. Free memory was 150.3MB in the beginning and 149.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 243.18ms. Allocated memory is still 174.1MB. Free memory was 149.0MB in the beginning and 138.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 46296.75ms. Allocated memory was 174.1MB in the beginning and 217.1MB in the end (delta: 43.0MB). Free memory was 137.8MB in the beginning and 144.6MB in the end (delta: -6.9MB). Peak memory consumption was 36.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.2s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 339 IncrementalHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 53 mSDtfsCounter, 339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 57 PreInvPairs, 90 NumberOfFragments, 347 HoareAnnotationTreeSize, 57 FomulaSimplifications, 109 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 697 FormulaSimplificationTreeSizeReductionInter, 0.4s 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: 16]: Loop Invariant Derived loop invariant: ((x + n / 4294967296 * 4294967296 <= n + 4294967296 * (x / 4294967296) && 0 < (x + 1) % 4294967296) && ((x + 1 == n && y == 1) || ((x + 1 <= n && 0 < (x + 2) % 4294967296) && n == y + x))) || (n == x && y == 0) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((n <= z + x && z + x <= n) && ((z + 2 <= 0 && 0 <= z + 2) || z <= 4294967296 * ((z + x + z / 4294967296 * 4294967296 + -1 * n) / 4294967296) + 4294967293)) || (((((z + 1 <= 0 && 0 <= z + 1) || z <= 4294967294 + 4294967296 * ((z + x + z / 4294967296 * 4294967296 + -1 * n) / 4294967296)) && (x + 1) / 4294967296 * 4294967296 <= x) && z + x <= n) && n / 4294967296 < z / 4294967296 + (x + 1) / 4294967296 + 1)) || (((((n <= z + x || n + 4294967296 * (x / 4294967296) < x + n / 4294967296 * 4294967296 + 1) && x + 1 <= n) && n <= y + 4294967296 * (x / 4294967296)) && ((z <= 0 && 0 <= z) || (z + x <= n && n / 4294967296 < z / 4294967296 + (x + 1) / 4294967296 + 1))) && n == y + x) - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-15 12:48:27,494 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...