/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:42:21,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:42:21,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:42:21,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:42:21,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:42:21,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:42:21,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:42:21,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:42:21,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:42:21,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:42:21,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:42:21,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:42:21,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:42:21,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:42:21,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:42:21,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:42:21,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:42:21,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:42:21,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:42:21,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:42:21,562 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:42:21,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:42:21,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:42:21,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:42:21,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:42:21,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:42:21,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:42:21,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:42:21,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:42:21,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:42:21,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:42:21,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:42:21,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:42:21,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:42:21,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:42:21,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:42:21,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:42:21,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:42:21,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:42:21,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:42:21,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:42:21,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:42:21,577 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:42:21,584 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:42:21,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:42:21,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:42:21,586 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:42:21,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:42:21,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:42:21,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:42:21,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:42:21,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:42:21,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:42:21,587 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:42:21,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:42:21,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:42:21,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:42:21,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:42:21,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:42:21,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:42:21,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:42:21,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:42:21,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:42:21,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:42:21,589 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:42:21,589 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:42:21,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:42:21,589 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:42:21,589 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 06:42:21,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:42:21,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:42:21,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:42:21,800 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:42:21,801 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:42:21,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c [2022-04-15 06:42:21,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2065d0105/1df1f26d49634b49960371b4ae5b3089/FLAG9e2d4464d [2022-04-15 06:42:22,249 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:42:22,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c [2022-04-15 06:42:22,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2065d0105/1df1f26d49634b49960371b4ae5b3089/FLAG9e2d4464d [2022-04-15 06:42:22,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2065d0105/1df1f26d49634b49960371b4ae5b3089 [2022-04-15 06:42:22,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:42:22,279 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:42:22,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:42:22,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:42:22,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:42:22,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:42:22" (1/1) ... [2022-04-15 06:42:22,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3518eb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:22, skipping insertion in model container [2022-04-15 06:42:22,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:42:22" (1/1) ... [2022-04-15 06:42:22,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:42:22,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:42:22,455 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/mono-crafted_10.c[319,332] [2022-04-15 06:42:22,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:42:22,471 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:42:22,481 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/mono-crafted_10.c[319,332] [2022-04-15 06:42:22,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:42:22,495 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:42:22,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:22 WrapperNode [2022-04-15 06:42:22,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:42:22,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:42:22,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:42:22,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:42:22,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:22" (1/1) ... [2022-04-15 06:42:22,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:22" (1/1) ... [2022-04-15 06:42:22,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:22" (1/1) ... [2022-04-15 06:42:22,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:22" (1/1) ... [2022-04-15 06:42:22,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:22" (1/1) ... [2022-04-15 06:42:22,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:22" (1/1) ... [2022-04-15 06:42:22,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:22" (1/1) ... [2022-04-15 06:42:22,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:42:22,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:42:22,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:42:22,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:42:22,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:22" (1/1) ... [2022-04-15 06:42:22,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:42:22,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:22,547 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 06:42:22,564 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 06:42:22,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:42:22,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:42:22,582 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:42:22,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:42:22,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:42:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:42:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:42:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:42:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:42:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:42:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:42:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:42:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:42:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:42:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:42:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:42:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:42:22,632 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:42:22,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:42:22,726 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:42:22,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:42:22,732 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:42:22,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:42:22 BoogieIcfgContainer [2022-04-15 06:42:22,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:42:22,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:42:22,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:42:22,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:42:22,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:42:22" (1/3) ... [2022-04-15 06:42:22,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb65b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:42:22, skipping insertion in model container [2022-04-15 06:42:22,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:22" (2/3) ... [2022-04-15 06:42:22,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb65b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:42:22, skipping insertion in model container [2022-04-15 06:42:22,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:42:22" (3/3) ... [2022-04-15 06:42:22,764 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_10.c [2022-04-15 06:42:22,768 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:42:22,768 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:42:22,808 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:42:22,823 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 06:42:22,823 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:42:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 06:42:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:42:22,848 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:22,848 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:22,849 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:22,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 1 times [2022-04-15 06:42:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:22,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1323536008] [2022-04-15 06:42:22,872 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:42:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 2 times [2022-04-15 06:42:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:22,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552687322] [2022-04-15 06:42:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:22,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:23,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:23,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 06:42:23,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:42:23,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-15 06:42:23,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:23,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 06:42:23,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:42:23,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-15 06:42:23,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-15 06:42:23,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {24#true} is VALID [2022-04-15 06:42:23,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-15 06:42:23,095 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~x~0 % 4294967296 then 1 else 0)); {25#false} is VALID [2022-04-15 06:42:23,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 06:42:23,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 06:42:23,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 06:42:23,096 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 06:42:23,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:23,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552687322] [2022-04-15 06:42:23,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552687322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:23,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:23,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:42:23,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:23,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1323536008] [2022-04-15 06:42:23,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1323536008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:23,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:23,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:42:23,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023933588] [2022-04-15 06:42:23,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:23,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:42:23,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:23,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:23,144 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:42:23,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:23,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:42:23,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:42:23,178 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:23,283 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 06:42:23,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:42:23,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:42:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:23,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 06:42:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 06:42:23,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-15 06:42:23,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:23,373 INFO L225 Difference]: With dead ends: 33 [2022-04-15 06:42:23,373 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 06:42:23,376 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:42:23,381 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:23,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:42:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 06:42:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 06:42:23,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:23,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 06:42:23,420 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 06:42:23,420 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 06:42:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:23,428 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 06:42:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 06:42:23,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:23,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:23,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 14 states. [2022-04-15 06:42:23,429 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 14 states. [2022-04-15 06:42:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:23,431 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 06:42:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 06:42:23,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:23,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:23,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:23,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 06:42:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 06:42:23,434 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 06:42:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:23,435 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 06:42:23,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 06:42:23,463 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 06:42:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 06:42:23,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:42:23,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:23,464 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:23,465 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:42:23,465 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:23,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 1 times [2022-04-15 06:42:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:23,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073469952] [2022-04-15 06:42:23,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:42:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 2 times [2022-04-15 06:42:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:23,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293331715] [2022-04-15 06:42:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:23,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:23,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {160#(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(18, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-15 06:42:23,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 06:42:23,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-15 06:42:23,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:23,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#(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(18, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-15 06:42:23,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 06:42:23,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-15 06:42:23,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret6 := main(); {154#true} is VALID [2022-04-15 06:42:23,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {159#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 06:42:23,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {155#false} is VALID [2022-04-15 06:42:23,646 INFO L272 TraceCheckUtils]: 7: Hoare triple {155#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~x~0 % 4294967296 then 1 else 0)); {155#false} is VALID [2022-04-15 06:42:23,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#false} ~cond := #in~cond; {155#false} is VALID [2022-04-15 06:42:23,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#false} assume 0 == ~cond; {155#false} is VALID [2022-04-15 06:42:23,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-15 06:42:23,647 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 06:42:23,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:23,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293331715] [2022-04-15 06:42:23,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293331715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:23,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:23,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:42:23,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:23,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073469952] [2022-04-15 06:42:23,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073469952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:23,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:23,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:42:23,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684915853] [2022-04-15 06:42:23,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:23,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:42:23,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:23,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:23,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:42:23,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:23,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:42:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:42:23,667 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:23,738 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 06:42:23,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:42:23,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:42:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 06:42:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 06:42:23,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-15 06:42:23,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:23,772 INFO L225 Difference]: With dead ends: 25 [2022-04-15 06:42:23,772 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:42:23,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:42:23,773 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:23,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:42:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:42:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 06:42:23,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:23,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 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 06:42:23,783 INFO L74 IsIncluded]: Start isIncluded. First operand 17 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 06:42:23,784 INFO L87 Difference]: Start difference. First operand 17 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 06:42:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:23,785 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 06:42:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 06:42:23,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:23,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:23,786 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 17 states. [2022-04-15 06:42:23,786 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 17 states. [2022-04-15 06:42:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:23,787 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 06:42:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 06:42:23,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:23,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:23,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:23,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:23,788 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 06:42:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 06:42:23,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-15 06:42:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:23,789 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 06:42:23,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 06:42:23,806 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 06:42:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 06:42:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:42:23,807 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:23,807 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:23,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:42:23,807 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:23,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash -79339060, now seen corresponding path program 1 times [2022-04-15 06:42:23,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:23,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1995393351] [2022-04-15 06:42:27,568 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:27,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:42:27,929 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:27,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1115131409, now seen corresponding path program 1 times [2022-04-15 06:42:27,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:27,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142903085] [2022-04-15 06:42:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:27,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:28,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:28,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#(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(18, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-15 06:42:28,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 06:42:28,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {281#true} {281#true} #42#return; {281#true} is VALID [2022-04-15 06:42:28,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:28,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#(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(18, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-15 06:42:28,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 06:42:28,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #42#return; {281#true} is VALID [2022-04-15 06:42:28,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-15 06:42:28,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {286#(and (= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) (div main_~y~0 4294967296))) (<= 10000000 main_~y~0))} is VALID [2022-04-15 06:42:28,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {286#(and (= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) (div main_~y~0 4294967296))) (<= 10000000 main_~y~0))} [48] L11-2-->L11-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_11 4294967296)) (.cse6 (mod v_main_~y~0_4 4294967296))) (let ((.cse2 (< .cse1 .cse6)) (.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse3 (= |v_main_#t~post5_4| |v_main_#t~post5_3|))) (or (and .cse0 (or (not (< .cse1 5000000)) (not .cse2)) .cse3) (let ((.cse4 (* (- 1) v_main_~x~0_10)) (.cse5 (+ (div (+ v_main_~x~0_11 (- 4294967295)) 4294967296) 1))) (and (<= (div (+ 5000000 .cse4) (- 4294967296)) .cse5) .cse2 (<= (div (+ .cse6 .cse4) (- 4294967296)) .cse5) (< v_main_~x~0_11 v_main_~x~0_10))) (and .cse0 .cse3 (= v_main_~y~0_4 v_main_~y~0_4))))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_11} OutVars{main_#t~post5=|v_main_#t~post5_3|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_10} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {287#(and (or (and (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0)) (not (= main_~x~0 0))) (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ 5000000 (* (div main_~y~0 4294967296) 4294967296) main_~x~0) main_~y~0))} is VALID [2022-04-15 06:42:28,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {287#(and (or (and (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0)) (not (= main_~x~0 0))) (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ 5000000 (* (div main_~y~0 4294967296) 4294967296) main_~x~0) main_~y~0))} [47] L11-3_primed-->L11-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {282#false} is VALID [2022-04-15 06:42:28,138 INFO L272 TraceCheckUtils]: 8: Hoare triple {282#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~x~0 % 4294967296 then 1 else 0)); {282#false} is VALID [2022-04-15 06:42:28,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#false} ~cond := #in~cond; {282#false} is VALID [2022-04-15 06:42:28,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} assume 0 == ~cond; {282#false} is VALID [2022-04-15 06:42:28,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-15 06:42:28,139 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 06:42:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:28,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142903085] [2022-04-15 06:42:28,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142903085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:28,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:28,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:42:28,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:28,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1995393351] [2022-04-15 06:42:28,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1995393351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:28,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:28,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:42:28,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136766635] [2022-04-15 06:42:28,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:28,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:42:28,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:28,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:42:28,334 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 06:42:28,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:42:28,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:28,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:42:28,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:42:28,335 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:42:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:28,601 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 06:42:28,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:42:28,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:42:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:42:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-15 06:42:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:42:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-15 06:42:28,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-15 06:42:28,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:28,646 INFO L225 Difference]: With dead ends: 26 [2022-04-15 06:42:28,646 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 06:42:28,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:42:28,647 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:28,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 18 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:42:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 06:42:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-15 06:42:28,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:28,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 06:42:28,682 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 06:42:28,682 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 06:42:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:28,684 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 06:42:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:42:28,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:28,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:28,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 21 states. [2022-04-15 06:42:28,687 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 21 states. [2022-04-15 06:42:28,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:28,689 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 06:42:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:42:28,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:28,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:28,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:28,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 06:42:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 06:42:28,695 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-15 06:42:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:28,696 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 06:42:28,696 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:42:28,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 06:42:28,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 06:42:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:42:28,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:28,725 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:28,725 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:42:28,727 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:28,727 INFO L85 PathProgramCache]: Analyzing trace with hash 309814626, now seen corresponding path program 1 times [2022-04-15 06:42:28,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:28,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1871106447] [2022-04-15 06:42:33,089 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:33,585 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:42:37,943 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:38,375 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:42:38,377 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:38,383 INFO L85 PathProgramCache]: Analyzing trace with hash 764545454, now seen corresponding path program 1 times [2022-04-15 06:42:38,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:38,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337082642] [2022-04-15 06:42:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:38,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:38,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:38,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {443#(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(18, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-04-15 06:42:38,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-15 06:42:38,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {432#true} {432#true} #42#return; {432#true} is VALID [2022-04-15 06:42:38,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:38,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {443#(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(18, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-04-15 06:42:38,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-15 06:42:38,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #42#return; {432#true} is VALID [2022-04-15 06:42:38,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret6 := main(); {432#true} is VALID [2022-04-15 06:42:38,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {437#(and (= main_~x~0 0) (<= 5000000 main_~z~0) (<= 10000000 main_~y~0) (<= main_~z~0 5000000) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 06:42:38,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(and (= main_~x~0 0) (<= 5000000 main_~z~0) (<= 10000000 main_~y~0) (<= main_~z~0 5000000) (<= (div main_~y~0 4294967296) 0))} [50] L11-2-->L11-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_18 4294967296))) (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse3 (< .cse1 5000000)) (.cse2 (mod v_main_~y~0_6 4294967296))) (or (and (= |v_main_#t~post5_10| |v_main_#t~post5_8|) .cse0 (= v_main_~y~0_6 v_main_~y~0_6)) (and .cse0 (or (not (< .cse1 .cse2)) (not .cse3)) (= |v_main_#t~post5_8| |v_main_#t~post5_10|)) (let ((.cse4 (* (- 1) v_main_~x~0_17)) (.cse5 (+ (div (+ v_main_~x~0_18 (- 4294967295)) 4294967296) 1))) (and (<= (div (+ 5000000 .cse4) (- 4294967296)) .cse5) (< v_main_~x~0_18 v_main_~x~0_17) .cse3 (<= (div (+ .cse2 .cse4) (- 4294967296)) .cse5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_18} OutVars{main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {438#(and (<= (+ main_~z~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) 5000000) (<= (+ main_~x~0 10000000) (+ main_~z~0 main_~y~0)) (<= main_~x~0 (+ main_~z~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 06:42:38,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#(and (<= (+ main_~z~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) 5000000) (<= (+ main_~x~0 10000000) (+ main_~z~0 main_~y~0)) (<= main_~x~0 (+ main_~z~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div main_~y~0 4294967296) 0))} [51] L11-3_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#(and (<= (+ main_~z~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) 5000000) (<= (+ main_~x~0 10000000) (+ main_~z~0 main_~y~0)) (<= main_~x~0 (+ main_~z~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 06:42:38,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(and (<= (+ main_~z~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) 5000000) (<= (+ main_~x~0 10000000) (+ main_~z~0 main_~y~0)) (<= main_~x~0 (+ main_~z~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div main_~y~0 4294967296) 0))} [52] L11-2-->L11-3_primed: Formula: (let ((.cse5 (mod v_main_~y~0_7 4294967296)) (.cse6 (mod v_main_~x~0_20 4294967296))) (let ((.cse2 (<= 5000000 .cse6)) (.cse1 (< .cse6 .cse5)) (.cse0 (= v_main_~z~0_7 v_main_~z~0_6)) (.cse3 (= |v_main_#t~post4_4| |v_main_#t~post4_3|)) (.cse4 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= |v_main_#t~post5_9| |v_main_#t~post5_13|) .cse3 .cse4) (and (< v_main_~x~0_20 v_main_~x~0_19) (<= (div (+ (* (- 1) v_main_~x~0_19) .cse5) (- 4294967296)) (+ (div (+ v_main_~x~0_20 (- 4294967295)) 4294967296) 1)) .cse2 (= (+ v_main_~x~0_19 v_main_~z~0_7) (+ v_main_~x~0_20 v_main_~z~0_6)) .cse1) (and (= |v_main_#t~post5_13| |v_main_#t~post5_9|) (= v_main_~y~0_7 v_main_~y~0_7) .cse0 .cse3 .cse4)))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~y~0=v_main_~y~0_7, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_20, main_~z~0=v_main_~z~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_9|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_19, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_#t~post5] {439#(and (or (and (< (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)) 1)) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ main_~x~0 4304967296 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ 5000000 main_~x~0) main_~y~0))) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 06:42:38,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {439#(and (or (and (< (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)) 1)) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ main_~x~0 4304967296 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ 5000000 main_~x~0) main_~y~0))) (<= (div main_~y~0 4294967296) 0))} [49] L11-3_primed-->L11-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {440#(and (< (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)) 1)) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:42:38,832 INFO L272 TraceCheckUtils]: 10: Hoare triple {440#(and (< (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)) 1)) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~x~0 % 4294967296 then 1 else 0)); {441#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:42:38,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {441#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {442#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:42:38,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {442#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {433#false} is VALID [2022-04-15 06:42:38,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-04-15 06:42:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:38,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337082642] [2022-04-15 06:42:38,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337082642] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:38,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918870735] [2022-04-15 06:42:38,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:38,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:38,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:38,836 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 06:42:38,837 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 06:42:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:38,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:42:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:38,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:46,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {432#true} is VALID [2022-04-15 06:42:46,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#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(18, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-04-15 06:42:46,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-15 06:42:46,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #42#return; {432#true} is VALID [2022-04-15 06:42:46,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret6 := main(); {432#true} is VALID [2022-04-15 06:42:46,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {462#(and (= main_~x~0 0) (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-15 06:42:46,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(and (= main_~x~0 0) (= main_~y~0 10000000) (= 5000000 main_~z~0))} [50] L11-2-->L11-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_18 4294967296))) (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse3 (< .cse1 5000000)) (.cse2 (mod v_main_~y~0_6 4294967296))) (or (and (= |v_main_#t~post5_10| |v_main_#t~post5_8|) .cse0 (= v_main_~y~0_6 v_main_~y~0_6)) (and .cse0 (or (not (< .cse1 .cse2)) (not .cse3)) (= |v_main_#t~post5_8| |v_main_#t~post5_10|)) (let ((.cse4 (* (- 1) v_main_~x~0_17)) (.cse5 (+ (div (+ v_main_~x~0_18 (- 4294967295)) 4294967296) 1))) (and (<= (div (+ 5000000 .cse4) (- 4294967296)) .cse5) (< v_main_~x~0_18 v_main_~x~0_17) .cse3 (<= (div (+ .cse2 .cse4) (- 4294967296)) .cse5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_18} OutVars{main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {466#(and (or (= main_~x~0 0) (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0))) (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-15 06:42:46,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#(and (or (= main_~x~0 0) (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0))) (= main_~y~0 10000000) (= 5000000 main_~z~0))} [51] L11-3_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#(and (or (= main_~x~0 0) (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0))) (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-15 06:42:46,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(and (or (= main_~x~0 0) (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0))) (= main_~y~0 10000000) (= 5000000 main_~z~0))} [52] L11-2-->L11-3_primed: Formula: (let ((.cse5 (mod v_main_~y~0_7 4294967296)) (.cse6 (mod v_main_~x~0_20 4294967296))) (let ((.cse2 (<= 5000000 .cse6)) (.cse1 (< .cse6 .cse5)) (.cse0 (= v_main_~z~0_7 v_main_~z~0_6)) (.cse3 (= |v_main_#t~post4_4| |v_main_#t~post4_3|)) (.cse4 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= |v_main_#t~post5_9| |v_main_#t~post5_13|) .cse3 .cse4) (and (< v_main_~x~0_20 v_main_~x~0_19) (<= (div (+ (* (- 1) v_main_~x~0_19) .cse5) (- 4294967296)) (+ (div (+ v_main_~x~0_20 (- 4294967295)) 4294967296) 1)) .cse2 (= (+ v_main_~x~0_19 v_main_~z~0_7) (+ v_main_~x~0_20 v_main_~z~0_6)) .cse1) (and (= |v_main_#t~post5_13| |v_main_#t~post5_9|) (= v_main_~y~0_7 v_main_~y~0_7) .cse0 .cse3 .cse4)))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~y~0=v_main_~y~0_7, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_20, main_~z~0=v_main_~z~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_9|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_19, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_#t~post5] {473#(and (= main_~y~0 10000000) (or (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0) (= 5000000 main_~z~0)) (and (= main_~x~0 0) (= 5000000 main_~z~0)) (and (<= (div (+ (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ (- 4289967295) main_~x~0 (* (- 1) main_~z~0)) 4294967296) 1)) (<= 5000000 (mod (+ 5000000 main_~x~0 (* main_~z~0 4294967295)) 4294967296)) (< 5000000 main_~z~0) (< main_~z~0 (+ 5000000 main_~x~0)) (<= (div (+ main_~z~0 (* (- 1) main_~x~0)) (- 4294967296)) 0))))} is VALID [2022-04-15 06:42:46,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(and (= main_~y~0 10000000) (or (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0) (= 5000000 main_~z~0)) (and (= main_~x~0 0) (= 5000000 main_~z~0)) (and (<= (div (+ (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ (- 4289967295) main_~x~0 (* (- 1) main_~z~0)) 4294967296) 1)) (<= 5000000 (mod (+ 5000000 main_~x~0 (* main_~z~0 4294967295)) 4294967296)) (< 5000000 main_~z~0) (< main_~z~0 (+ 5000000 main_~x~0)) (<= (div (+ main_~z~0 (* (- 1) main_~x~0)) (- 4294967296)) 0))))} [49] L11-3_primed-->L11-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {477#(and (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) (+ (div (+ (- 4289967295) main_~x~0 (* (- 1) main_~z~0)) 4294967296) 1)) (<= 5000000 (mod (+ 5000000 main_~x~0 (* main_~z~0 4294967295)) 4294967296)) (< 5000000 main_~z~0) (< main_~z~0 (+ 5000000 main_~x~0)) (not (< (mod main_~x~0 4294967296) 10000000)) (<= (div (+ main_~z~0 (* (- 1) main_~x~0)) (- 4294967296)) 0))} is VALID [2022-04-15 06:42:46,622 INFO L272 TraceCheckUtils]: 10: Hoare triple {477#(and (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) (+ (div (+ (- 4289967295) main_~x~0 (* (- 1) main_~z~0)) 4294967296) 1)) (<= 5000000 (mod (+ 5000000 main_~x~0 (* main_~z~0 4294967295)) 4294967296)) (< 5000000 main_~z~0) (< main_~z~0 (+ 5000000 main_~x~0)) (not (< (mod main_~x~0 4294967296) 10000000)) (<= (div (+ main_~z~0 (* (- 1) main_~x~0)) (- 4294967296)) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~x~0 % 4294967296 then 1 else 0)); {481#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:42:46,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {485#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:42:46,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {485#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {433#false} is VALID [2022-04-15 06:42:46,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-04-15 06:42:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:46,624 INFO L328 TraceCheckSpWp]: Computing backward predicates...